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_two_index_05_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:08:33,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:08:33,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:08:33,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:08:33,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:08:33,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:08:33,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:08:33,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:08:33,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:08:33,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:08:33,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:08:33,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:08:33,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:08:33,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:08:33,943 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:08:33,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:08:33,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:08:33,950 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:08:33,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:08:33,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:08:33,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:08:33,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:08:33,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:08:33,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:08:33,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:08:33,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:08:33,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:08:33,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:08:33,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:08:33,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:08:33,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:08:33,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:08:33,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:08:33,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:08:33,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:08:33,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:08:33,988 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:08:34,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:08:34,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:08:34,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:08:34,021 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:08:34,022 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:08:34,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:08:34,022 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:08:34,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:08:34,027 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:08:34,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:08:34,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:08:34,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:08:34,028 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:08:34,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:08:34,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:08:34,028 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:08:34,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:08:34,028 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:08:34,029 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:08:34,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:08:34,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:08:34,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:08:34,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:08:34,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:08:34,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:08:34,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:08:34,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:08:34,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:08:34,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:08:34,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:08:34,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:08:34,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:08:34,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:08:34,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:08:34,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:08:34,126 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:08:34,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_05_true-unreach-call.i [2018-11-23 12:08:34,192 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed3ba4d8/3f45f0709bdd4b86893e00a1ce4bf821/FLAG9ed452a4d [2018-11-23 12:08:34,670 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:08:34,671 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_05_true-unreach-call.i [2018-11-23 12:08:34,679 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed3ba4d8/3f45f0709bdd4b86893e00a1ce4bf821/FLAG9ed452a4d [2018-11-23 12:08:35,033 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed3ba4d8/3f45f0709bdd4b86893e00a1ce4bf821 [2018-11-23 12:08:35,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:08:35,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:08:35,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:35,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:08:35,050 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:08:35,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f51387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35, skipping insertion in model container [2018-11-23 12:08:35,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:08:35,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:08:35,341 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:35,347 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:08:35,382 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:35,413 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:08:35,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35 WrapperNode [2018-11-23 12:08:35,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:35,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:35,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:08:35,415 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:08:35,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:35,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:08:35,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:08:35,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:08:35,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... [2018-11-23 12:08:35,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:08:35,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:08:35,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:08:35,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:08:35,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:08:35,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:08:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:08:35,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:08:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:08:35,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:08:35,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:08:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:08:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:08:35,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:08:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:08:35,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:08:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:08:36,160 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:08:36,161 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:08:36,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:36 BoogieIcfgContainer [2018-11-23 12:08:36,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:08:36,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:08:36,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:08:36,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:08:36,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:08:35" (1/3) ... [2018-11-23 12:08:36,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b9b541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:36, skipping insertion in model container [2018-11-23 12:08:36,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:35" (2/3) ... [2018-11-23 12:08:36,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b9b541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:36, skipping insertion in model container [2018-11-23 12:08:36,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:36" (3/3) ... [2018-11-23 12:08:36,170 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_05_true-unreach-call.i [2018-11-23 12:08:36,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:08:36,191 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:08:36,210 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:08:36,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:08:36,245 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:08:36,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:08:36,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:08:36,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:08:36,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:08:36,247 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:08:36,247 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:08:36,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:08:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:08:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:08:36,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:36,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:36,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:36,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 12:08:36,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:36,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:36,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:36,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:36,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:08:36,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:08:36,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:08:36,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 12:08:36,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 12:08:36,454 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {27#true} is VALID [2018-11-23 12:08:36,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 12:08:36,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1; {28#false} is VALID [2018-11-23 12:08:36,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !(~i~0 < 100000); {28#false} is VALID [2018-11-23 12:08:36,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1;~j~0 := 0; {28#false} is VALID [2018-11-23 12:08:36,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {28#false} is VALID [2018-11-23 12:08:36,459 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {28#false} is VALID [2018-11-23 12:08:36,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 12:08:36,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 12:08:36,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:08:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:36,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:36,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:08:36,471 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:08:36,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:36,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:08:36,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:36,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:08:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:08:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:36,592 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 12:08:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:36,798 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 12:08:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:08:36,800 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:08:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:08:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:08:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:08:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:08:36,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:08:37,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:37,120 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:08:37,120 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:08:37,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:08:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:08:37,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:37,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:37,163 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:37,163 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,167 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:08:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:08:37,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:37,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:37,169 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:37,169 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:08:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,172 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 12:08:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:08:37,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:37,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:37,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:37,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:08:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 12:08:37,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 12:08:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:37,177 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 12:08:37,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:08:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 12:08:37,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:08:37,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:37,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:37,179 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:37,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 12:08:37,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:37,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:37,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:37,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2018-11-23 12:08:37,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {151#true} is VALID [2018-11-23 12:08:37,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2018-11-23 12:08:37,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #60#return; {151#true} is VALID [2018-11-23 12:08:37,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2018-11-23 12:08:37,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {151#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {153#(= main_~i~0 0)} is VALID [2018-11-23 12:08:37,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(= main_~i~0 0)} assume !(~i~0 < 100000); {152#false} is VALID [2018-11-23 12:08:37,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 1; {152#false} is VALID [2018-11-23 12:08:37,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {152#false} assume !(~i~0 < 100000); {152#false} is VALID [2018-11-23 12:08:37,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {152#false} ~i~0 := 1;~j~0 := 0; {152#false} is VALID [2018-11-23 12:08:37,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {152#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {152#false} is VALID [2018-11-23 12:08:37,261 INFO L256 TraceCheckUtils]: 11: Hoare triple {152#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {152#false} is VALID [2018-11-23 12:08:37,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2018-11-23 12:08:37,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2018-11-23 12:08:37,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {152#false} assume !false; {152#false} is VALID [2018-11-23 12:08:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:37,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:37,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:08:37,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:08:37,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:37,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:08:37,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:37,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:08:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:08:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:08:37,393 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 12:08:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,529 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:08:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:08:37,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 12:08:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:08:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:08:37,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:08:37,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:37,613 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:08:37,613 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:08:37,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:08:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:08:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:08:37,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:37,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:37,628 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:37,628 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,630 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:08:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:08:37,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:37,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:37,631 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:37,631 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:08:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:37,633 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 12:08:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:08:37,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:37,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:37,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:37,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:08:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 12:08:37,637 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 12:08:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:37,637 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 12:08:37,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:08:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 12:08:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:08:37,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:37,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:37,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:37,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 12:08:37,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:37,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:37,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:37,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:37,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:37,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-23 12:08:37,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {272#true} is VALID [2018-11-23 12:08:37,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-23 12:08:37,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #60#return; {272#true} is VALID [2018-11-23 12:08:37,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret4 := main(); {272#true} is VALID [2018-11-23 12:08:37,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {272#true} is VALID [2018-11-23 12:08:37,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {272#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {272#true} is VALID [2018-11-23 12:08:37,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {272#true} assume !(~i~0 < 100000); {272#true} is VALID [2018-11-23 12:08:37,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {272#true} ~i~0 := 1; {274#(= main_~i~0 1)} is VALID [2018-11-23 12:08:37,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {274#(= main_~i~0 1)} assume !(~i~0 < 100000); {273#false} is VALID [2018-11-23 12:08:37,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {273#false} ~i~0 := 1;~j~0 := 0; {273#false} is VALID [2018-11-23 12:08:37,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {273#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {273#false} is VALID [2018-11-23 12:08:37,849 INFO L256 TraceCheckUtils]: 12: Hoare triple {273#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {273#false} is VALID [2018-11-23 12:08:37,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {273#false} ~cond := #in~cond; {273#false} is VALID [2018-11-23 12:08:37,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#false} assume 0 == ~cond; {273#false} is VALID [2018-11-23 12:08:37,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-23 12:08:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:37,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:37,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:08:37,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:08:37,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:37,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:08:38,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:38,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:08:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:08:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:08:38,055 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 12:08:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,201 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:08:38,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:08:38,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:08:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-23 12:08:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:08:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-23 12:08:38,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2018-11-23 12:08:38,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:38,395 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:08:38,395 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:08:38,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:08:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:08:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-23 12:08:38,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:38,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 21 states. [2018-11-23 12:08:38,446 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 21 states. [2018-11-23 12:08:38,446 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 21 states. [2018-11-23 12:08:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,450 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:08:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:08:38,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:38,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:38,451 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states. [2018-11-23 12:08:38,451 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states. [2018-11-23 12:08:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:38,454 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 12:08:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 12:08:38,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:38,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:38,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:38,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:08:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 12:08:38,457 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-11-23 12:08:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:38,458 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 12:08:38,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:08:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:08:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:08:38,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:38,459 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 12:08:38,459 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:38,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash -59429947, now seen corresponding path program 1 times [2018-11-23 12:08:38,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:38,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:38,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:38,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 12:08:38,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {407#true} is VALID [2018-11-23 12:08:38,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 12:08:38,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #60#return; {407#true} is VALID [2018-11-23 12:08:38,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret4 := main(); {407#true} is VALID [2018-11-23 12:08:38,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {409#(= main_~i~0 0)} is VALID [2018-11-23 12:08:38,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {409#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {410#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:38,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~i~0 1)} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:38,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#false} ~i~0 := 1; {408#false} is VALID [2018-11-23 12:08:38,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {408#false} is VALID [2018-11-23 12:08:38,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:38,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} ~i~0 := 1;~j~0 := 0; {408#false} is VALID [2018-11-23 12:08:38,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {408#false} is VALID [2018-11-23 12:08:38,571 INFO L256 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {408#false} is VALID [2018-11-23 12:08:38,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 12:08:38,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 12:08:38,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 12:08:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:38,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:38,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:38,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:38,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:38,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-23 12:08:38,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {407#true} is VALID [2018-11-23 12:08:38,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-23 12:08:38,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #60#return; {407#true} is VALID [2018-11-23 12:08:38,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret4 := main(); {407#true} is VALID [2018-11-23 12:08:38,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {429#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:38,914 INFO L273 TraceCheckUtils]: 6: Hoare triple {429#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {410#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:38,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {410#(<= main_~i~0 1)} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:38,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#false} ~i~0 := 1; {408#false} is VALID [2018-11-23 12:08:38,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {408#false} is VALID [2018-11-23 12:08:38,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {408#false} assume !(~i~0 < 100000); {408#false} is VALID [2018-11-23 12:08:38,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {408#false} ~i~0 := 1;~j~0 := 0; {408#false} is VALID [2018-11-23 12:08:38,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {408#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {408#false} is VALID [2018-11-23 12:08:38,916 INFO L256 TraceCheckUtils]: 13: Hoare triple {408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {408#false} is VALID [2018-11-23 12:08:38,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2018-11-23 12:08:38,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2018-11-23 12:08:38,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-23 12:08:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:38,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:38,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:08:38,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:08:38,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:38,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:08:39,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:39,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:08:39,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:08:39,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:08:39,006 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-23 12:08:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:39,336 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 12:08:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:08:39,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:08:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:08:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:08:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:08:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2018-11-23 12:08:39,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2018-11-23 12:08:39,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:39,461 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:08:39,462 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:08:39,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:08:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:08:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-23 12:08:39,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:39,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2018-11-23 12:08:39,487 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2018-11-23 12:08:39,487 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2018-11-23 12:08:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:39,490 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:08:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:08:39,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:39,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:39,491 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2018-11-23 12:08:39,492 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2018-11-23 12:08:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:39,494 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 12:08:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:08:39,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:39,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:39,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:39,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:08:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 12:08:39,497 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-11-23 12:08:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:39,498 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:08:39,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:08:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:08:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:08:39,499 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:39,499 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:39,499 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:39,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:39,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1302144745, now seen corresponding path program 2 times [2018-11-23 12:08:39,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:39,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:39,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:39,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:39,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 12:08:39,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {603#true} is VALID [2018-11-23 12:08:39,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 12:08:39,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #60#return; {603#true} is VALID [2018-11-23 12:08:39,606 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret4 := main(); {603#true} is VALID [2018-11-23 12:08:39,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {605#(= main_~i~0 0)} is VALID [2018-11-23 12:08:39,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {606#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:39,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {607#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:39,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~i~0 2)} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:39,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#false} ~i~0 := 1; {604#false} is VALID [2018-11-23 12:08:39,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {604#false} is VALID [2018-11-23 12:08:39,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#false} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:39,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} ~i~0 := 1;~j~0 := 0; {604#false} is VALID [2018-11-23 12:08:39,614 INFO L273 TraceCheckUtils]: 13: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {604#false} is VALID [2018-11-23 12:08:39,614 INFO L256 TraceCheckUtils]: 14: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {604#false} is VALID [2018-11-23 12:08:39,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2018-11-23 12:08:39,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2018-11-23 12:08:39,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 12:08:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:39,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:39,617 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:39,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:39,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:39,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:39,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:39,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2018-11-23 12:08:39,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {603#true} is VALID [2018-11-23 12:08:39,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2018-11-23 12:08:39,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #60#return; {603#true} is VALID [2018-11-23 12:08:39,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret4 := main(); {603#true} is VALID [2018-11-23 12:08:39,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {626#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:39,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {626#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {606#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:39,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {607#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:39,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~i~0 2)} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:39,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {604#false} ~i~0 := 1; {604#false} is VALID [2018-11-23 12:08:39,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {604#false} is VALID [2018-11-23 12:08:39,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {604#false} assume !(~i~0 < 100000); {604#false} is VALID [2018-11-23 12:08:39,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {604#false} ~i~0 := 1;~j~0 := 0; {604#false} is VALID [2018-11-23 12:08:39,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {604#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {604#false} is VALID [2018-11-23 12:08:39,798 INFO L256 TraceCheckUtils]: 14: Hoare triple {604#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {604#false} is VALID [2018-11-23 12:08:39,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {604#false} ~cond := #in~cond; {604#false} is VALID [2018-11-23 12:08:39,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {604#false} assume 0 == ~cond; {604#false} is VALID [2018-11-23 12:08:39,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {604#false} assume !false; {604#false} is VALID [2018-11-23 12:08:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:39,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:39,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:08:39,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:08:39,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:39,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:08:39,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:39,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:08:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:08:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:08:39,843 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-23 12:08:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,048 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 12:08:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:08:40,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 12:08:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:08:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 12:08:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:08:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2018-11-23 12:08:40,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2018-11-23 12:08:40,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:40,134 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:08:40,134 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:08:40,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:08:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:08:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 12:08:40,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:40,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2018-11-23 12:08:40,153 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2018-11-23 12:08:40,153 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2018-11-23 12:08:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,155 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:08:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:08:40,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:40,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:40,156 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2018-11-23 12:08:40,156 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2018-11-23 12:08:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,158 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 12:08:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 12:08:40,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:40,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:40,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:40,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:08:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:08:40,161 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-11-23 12:08:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:40,162 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:08:40,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:08:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:08:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:08:40,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:40,163 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:40,163 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:40,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash 561287237, now seen corresponding path program 3 times [2018-11-23 12:08:40,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:40,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:40,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:40,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2018-11-23 12:08:40,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {809#true} is VALID [2018-11-23 12:08:40,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2018-11-23 12:08:40,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #60#return; {809#true} is VALID [2018-11-23 12:08:40,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret4 := main(); {809#true} is VALID [2018-11-23 12:08:40,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {811#(= main_~i~0 0)} is VALID [2018-11-23 12:08:40,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {812#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:40,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {812#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {813#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:40,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {813#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {814#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:40,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {814#(<= main_~i~0 3)} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:08:40,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {810#false} ~i~0 := 1; {810#false} is VALID [2018-11-23 12:08:40,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {810#false} is VALID [2018-11-23 12:08:40,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {810#false} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:08:40,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#false} ~i~0 := 1;~j~0 := 0; {810#false} is VALID [2018-11-23 12:08:40,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {810#false} is VALID [2018-11-23 12:08:40,335 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {810#false} is VALID [2018-11-23 12:08:40,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2018-11-23 12:08:40,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2018-11-23 12:08:40,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#false} assume !false; {810#false} is VALID [2018-11-23 12:08:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:08:40,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:40,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:40,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:40,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:08:40,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:40,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:40,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2018-11-23 12:08:40,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {809#true} is VALID [2018-11-23 12:08:40,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2018-11-23 12:08:40,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #60#return; {809#true} is VALID [2018-11-23 12:08:40,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret4 := main(); {809#true} is VALID [2018-11-23 12:08:40,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {809#true} is VALID [2018-11-23 12:08:40,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:08:40,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:08:40,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {809#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {809#true} is VALID [2018-11-23 12:08:40,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {809#true} assume !(~i~0 < 100000); {809#true} is VALID [2018-11-23 12:08:40,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {809#true} ~i~0 := 1; {812#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:40,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {851#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:40,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {851#(<= main_~i~0 6)} assume !(~i~0 < 100000); {810#false} is VALID [2018-11-23 12:08:40,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#false} ~i~0 := 1;~j~0 := 0; {810#false} is VALID [2018-11-23 12:08:40,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {810#false} is VALID [2018-11-23 12:08:40,433 INFO L256 TraceCheckUtils]: 15: Hoare triple {810#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {810#false} is VALID [2018-11-23 12:08:40,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2018-11-23 12:08:40,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2018-11-23 12:08:40,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {810#false} assume !false; {810#false} is VALID [2018-11-23 12:08:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:40,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-23 12:08:40,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:08:40,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:40,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:08:40,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:40,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:08:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:08:40,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:08:40,499 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2018-11-23 12:08:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,692 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 12:08:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:08:40,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:08:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:08:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:08:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:08:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-23 12:08:40,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-23 12:08:40,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:40,859 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:08:40,859 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:08:40,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:08:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:08:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 12:08:40,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:40,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 26 states. [2018-11-23 12:08:40,878 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 26 states. [2018-11-23 12:08:40,878 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 26 states. [2018-11-23 12:08:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,881 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:08:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:08:40,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:40,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:40,882 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 32 states. [2018-11-23 12:08:40,882 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 32 states. [2018-11-23 12:08:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:40,884 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:08:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:08:40,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:40,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:40,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:40,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:08:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 12:08:40,887 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 12:08:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:40,888 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 12:08:40,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:08:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:08:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:08:40,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:40,889 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:40,889 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:40,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 53593642, now seen corresponding path program 4 times [2018-11-23 12:08:40,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:40,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:40,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:40,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:40,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:41,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 12:08:41,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 12:08:41,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 12:08:41,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #60#return; {1048#true} is VALID [2018-11-23 12:08:41,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 12:08:41,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1050#(= main_~i~0 0)} is VALID [2018-11-23 12:08:41,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {1050#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:41,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:41,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1053#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:41,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1054#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:41,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1055#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:41,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:41,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} ~i~0 := 1; {1049#false} is VALID [2018-11-23 12:08:41,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:41,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:41,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:41,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} ~i~0 := 1;~j~0 := 0; {1049#false} is VALID [2018-11-23 12:08:41,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1049#false} is VALID [2018-11-23 12:08:41,083 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1049#false} is VALID [2018-11-23 12:08:41,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 12:08:41,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 12:08:41,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 12:08:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:41,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:41,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:41,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:41,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:41,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:41,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:41,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 12:08:41,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 12:08:41,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 12:08:41,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #60#return; {1048#true} is VALID [2018-11-23 12:08:41,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 12:08:41,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1074#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:41,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:41,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {1051#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:41,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1053#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:41,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1054#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:41,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1055#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:41,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:41,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {1049#false} ~i~0 := 1; {1049#false} is VALID [2018-11-23 12:08:41,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:41,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1049#false} is VALID [2018-11-23 12:08:41,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {1049#false} assume !(~i~0 < 100000); {1049#false} is VALID [2018-11-23 12:08:41,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#false} ~i~0 := 1;~j~0 := 0; {1049#false} is VALID [2018-11-23 12:08:41,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1049#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1049#false} is VALID [2018-11-23 12:08:41,372 INFO L256 TraceCheckUtils]: 18: Hoare triple {1049#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1049#false} is VALID [2018-11-23 12:08:41,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 12:08:41,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 12:08:41,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 12:08:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:41,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:41,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:08:41,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 12:08:41,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:41,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:08:41,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:41,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:08:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:08:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:08:41,465 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2018-11-23 12:08:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:41,884 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 12:08:41,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:08:41,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 12:08:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:08:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:08:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:08:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:08:41,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-23 12:08:41,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:41,946 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:08:41,947 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:08:41,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:08:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:08:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-23 12:08:41,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:41,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2018-11-23 12:08:41,987 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2018-11-23 12:08:41,987 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2018-11-23 12:08:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:41,989 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:08:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:08:41,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:41,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:41,991 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2018-11-23 12:08:41,991 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2018-11-23 12:08:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:41,993 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 12:08:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 12:08:41,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:41,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:41,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:41,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:08:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:08:41,996 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2018-11-23 12:08:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:41,996 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:08:41,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:08:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:08:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:08:41,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:41,997 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:41,998 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:41,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash -532864634, now seen corresponding path program 5 times [2018-11-23 12:08:41,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:41,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:42,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:42,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {1295#true} call ULTIMATE.init(); {1295#true} is VALID [2018-11-23 12:08:42,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {1295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1295#true} is VALID [2018-11-23 12:08:42,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {1295#true} assume true; {1295#true} is VALID [2018-11-23 12:08:42,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1295#true} {1295#true} #60#return; {1295#true} is VALID [2018-11-23 12:08:42,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {1295#true} call #t~ret4 := main(); {1295#true} is VALID [2018-11-23 12:08:42,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {1295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1297#(= main_~i~0 0)} is VALID [2018-11-23 12:08:42,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1298#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:42,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {1298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1299#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:42,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {1299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1300#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:42,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {1300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1301#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:42,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1302#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:42,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {1302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1303#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:42,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {1303#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:08:42,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1296#false} ~i~0 := 1; {1296#false} is VALID [2018-11-23 12:08:42,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:08:42,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:08:42,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {1296#false} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:08:42,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {1296#false} ~i~0 := 1;~j~0 := 0; {1296#false} is VALID [2018-11-23 12:08:42,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1296#false} is VALID [2018-11-23 12:08:42,203 INFO L256 TraceCheckUtils]: 19: Hoare triple {1296#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1296#false} is VALID [2018-11-23 12:08:42,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {1296#false} ~cond := #in~cond; {1296#false} is VALID [2018-11-23 12:08:42,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {1296#false} assume 0 == ~cond; {1296#false} is VALID [2018-11-23 12:08:42,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {1296#false} assume !false; {1296#false} is VALID [2018-11-23 12:08:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:42,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:42,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:42,269 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:08:42,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:42,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:42,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {1295#true} call ULTIMATE.init(); {1295#true} is VALID [2018-11-23 12:08:42,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {1295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1295#true} is VALID [2018-11-23 12:08:42,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {1295#true} assume true; {1295#true} is VALID [2018-11-23 12:08:42,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1295#true} {1295#true} #60#return; {1295#true} is VALID [2018-11-23 12:08:42,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {1295#true} call #t~ret4 := main(); {1295#true} is VALID [2018-11-23 12:08:42,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {1295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1322#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:42,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {1322#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1298#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:42,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1299#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:42,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {1299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1300#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:42,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {1300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1301#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:42,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {1301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1302#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:42,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {1302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1303#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:42,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {1303#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:08:42,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {1296#false} ~i~0 := 1; {1296#false} is VALID [2018-11-23 12:08:42,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:08:42,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1296#false} is VALID [2018-11-23 12:08:42,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {1296#false} assume !(~i~0 < 100000); {1296#false} is VALID [2018-11-23 12:08:42,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {1296#false} ~i~0 := 1;~j~0 := 0; {1296#false} is VALID [2018-11-23 12:08:42,403 INFO L273 TraceCheckUtils]: 18: Hoare triple {1296#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1296#false} is VALID [2018-11-23 12:08:42,403 INFO L256 TraceCheckUtils]: 19: Hoare triple {1296#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1296#false} is VALID [2018-11-23 12:08:42,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {1296#false} ~cond := #in~cond; {1296#false} is VALID [2018-11-23 12:08:42,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {1296#false} assume 0 == ~cond; {1296#false} is VALID [2018-11-23 12:08:42,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {1296#false} assume !false; {1296#false} is VALID [2018-11-23 12:08:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:42,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:42,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:08:42,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 12:08:42,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:42,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:08:42,505 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 12:08:42,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:08:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:08:42,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:08:42,506 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 10 states. [2018-11-23 12:08:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:42,901 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:08:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:08:42,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-23 12:08:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:08:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 12:08:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:08:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 12:08:42,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2018-11-23 12:08:43,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:43,038 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:08:43,039 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:08:43,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:08:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:08:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-23 12:08:43,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:43,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-23 12:08:43,133 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-23 12:08:43,133 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-23 12:08:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:43,137 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:08:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:08:43,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:43,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:43,138 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-23 12:08:43,138 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-23 12:08:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:43,140 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:08:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:08:43,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:43,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:43,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:43,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:08:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 12:08:43,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-11-23 12:08:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:43,143 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 12:08:43,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:08:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:08:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:08:43,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:43,144 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:43,144 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:43,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1533202006, now seen corresponding path program 6 times [2018-11-23 12:08:43,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:43,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:43,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:43,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {1563#true} call ULTIMATE.init(); {1563#true} is VALID [2018-11-23 12:08:43,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {1563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1563#true} is VALID [2018-11-23 12:08:43,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {1563#true} assume true; {1563#true} is VALID [2018-11-23 12:08:43,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1563#true} {1563#true} #60#return; {1563#true} is VALID [2018-11-23 12:08:43,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {1563#true} call #t~ret4 := main(); {1563#true} is VALID [2018-11-23 12:08:43,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {1563#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1565#(= main_~i~0 0)} is VALID [2018-11-23 12:08:43,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1566#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:43,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {1566#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1567#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:43,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {1567#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1568#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:43,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {1568#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1569#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:43,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {1569#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1570#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:43,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1571#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:43,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {1571#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1572#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:43,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {1572#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1564#false} is VALID [2018-11-23 12:08:43,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {1564#false} ~i~0 := 1; {1564#false} is VALID [2018-11-23 12:08:43,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {1564#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1564#false} is VALID [2018-11-23 12:08:43,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {1564#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1564#false} is VALID [2018-11-23 12:08:43,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {1564#false} assume !(~i~0 < 100000); {1564#false} is VALID [2018-11-23 12:08:43,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {1564#false} ~i~0 := 1;~j~0 := 0; {1564#false} is VALID [2018-11-23 12:08:43,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {1564#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1564#false} is VALID [2018-11-23 12:08:43,373 INFO L256 TraceCheckUtils]: 20: Hoare triple {1564#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1564#false} is VALID [2018-11-23 12:08:43,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {1564#false} ~cond := #in~cond; {1564#false} is VALID [2018-11-23 12:08:43,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {1564#false} assume 0 == ~cond; {1564#false} is VALID [2018-11-23 12:08:43,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {1564#false} assume !false; {1564#false} is VALID [2018-11-23 12:08:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:08:43,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:43,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:43,444 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-11-23 12:08:43,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:43,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:43,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {1563#true} call ULTIMATE.init(); {1563#true} is VALID [2018-11-23 12:08:43,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {1563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1563#true} is VALID [2018-11-23 12:08:43,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {1563#true} assume true; {1563#true} is VALID [2018-11-23 12:08:43,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1563#true} {1563#true} #60#return; {1563#true} is VALID [2018-11-23 12:08:43,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {1563#true} call #t~ret4 := main(); {1563#true} is VALID [2018-11-23 12:08:43,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {1563#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1563#true} is VALID [2018-11-23 12:08:43,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {1563#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1563#true} is VALID [2018-11-23 12:08:43,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {1563#true} assume !(~i~0 < 100000); {1563#true} is VALID [2018-11-23 12:08:43,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {1563#true} ~i~0 := 1; {1566#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:43,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {1566#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1571#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:43,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1624#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:43,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {1624#(<= main_~i~0 11)} assume !(~i~0 < 100000); {1564#false} is VALID [2018-11-23 12:08:43,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1564#false} ~i~0 := 1;~j~0 := 0; {1564#false} is VALID [2018-11-23 12:08:43,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {1564#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1564#false} is VALID [2018-11-23 12:08:43,552 INFO L256 TraceCheckUtils]: 20: Hoare triple {1564#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1564#false} is VALID [2018-11-23 12:08:43,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {1564#false} ~cond := #in~cond; {1564#false} is VALID [2018-11-23 12:08:43,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {1564#false} assume 0 == ~cond; {1564#false} is VALID [2018-11-23 12:08:43,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {1564#false} assume !false; {1564#false} is VALID [2018-11-23 12:08:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:08:43,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:43,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-11-23 12:08:43,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 12:08:43,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:43,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:08:43,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:43,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:08:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:08:43,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:08:43,610 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 11 states. [2018-11-23 12:08:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:44,014 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 12:08:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:08:44,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 12:08:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:08:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2018-11-23 12:08:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:08:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2018-11-23 12:08:44,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2018-11-23 12:08:44,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:44,103 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:08:44,103 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:08:44,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:08:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:08:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-23 12:08:44,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:44,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2018-11-23 12:08:44,142 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2018-11-23 12:08:44,142 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2018-11-23 12:08:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:44,145 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 12:08:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 12:08:44,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:44,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:44,146 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2018-11-23 12:08:44,146 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2018-11-23 12:08:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:44,148 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 12:08:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 12:08:44,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:44,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:44,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:44,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:08:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 12:08:44,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-11-23 12:08:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:44,151 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 12:08:44,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:08:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:08:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:08:44,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:44,152 INFO L402 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:44,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:44,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:44,152 INFO L82 PathProgramCache]: Analyzing trace with hash 73394789, now seen corresponding path program 7 times [2018-11-23 12:08:44,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:44,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:44,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:44,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:44,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:44,416 INFO L256 TraceCheckUtils]: 0: Hoare triple {1864#true} call ULTIMATE.init(); {1864#true} is VALID [2018-11-23 12:08:44,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {1864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1864#true} is VALID [2018-11-23 12:08:44,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {1864#true} assume true; {1864#true} is VALID [2018-11-23 12:08:44,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1864#true} {1864#true} #60#return; {1864#true} is VALID [2018-11-23 12:08:44,417 INFO L256 TraceCheckUtils]: 4: Hoare triple {1864#true} call #t~ret4 := main(); {1864#true} is VALID [2018-11-23 12:08:44,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {1864#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1866#(= main_~i~0 0)} is VALID [2018-11-23 12:08:44,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {1866#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1867#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {1867#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1868#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {1868#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1869#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {1869#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1870#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {1870#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1871#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1872#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {1872#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1873#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {1873#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1874#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {1874#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1875#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {1875#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1865#false} is VALID [2018-11-23 12:08:44,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {1865#false} ~i~0 := 1; {1865#false} is VALID [2018-11-23 12:08:44,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1865#false} is VALID [2018-11-23 12:08:44,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {1865#false} assume !(~i~0 < 100000); {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {1865#false} ~i~0 := 1;~j~0 := 0; {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L256 TraceCheckUtils]: 23: Hoare triple {1865#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {1865#false} ~cond := #in~cond; {1865#false} is VALID [2018-11-23 12:08:44,428 INFO L273 TraceCheckUtils]: 25: Hoare triple {1865#false} assume 0 == ~cond; {1865#false} is VALID [2018-11-23 12:08:44,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {1865#false} assume !false; {1865#false} is VALID [2018-11-23 12:08:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:44,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:44,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:44,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:44,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:44,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {1864#true} call ULTIMATE.init(); {1864#true} is VALID [2018-11-23 12:08:44,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {1864#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1864#true} is VALID [2018-11-23 12:08:44,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {1864#true} assume true; {1864#true} is VALID [2018-11-23 12:08:44,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1864#true} {1864#true} #60#return; {1864#true} is VALID [2018-11-23 12:08:44,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {1864#true} call #t~ret4 := main(); {1864#true} is VALID [2018-11-23 12:08:44,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {1864#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {1894#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:44,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {1894#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1867#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:44,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {1867#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1868#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:44,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {1868#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1869#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:44,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {1869#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1870#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:44,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {1870#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1871#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:44,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1872#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:44,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {1872#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1873#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:44,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {1873#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1874#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:44,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {1874#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {1875#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:44,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {1875#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1865#false} is VALID [2018-11-23 12:08:44,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {1865#false} ~i~0 := 1; {1865#false} is VALID [2018-11-23 12:08:44,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1865#false} is VALID [2018-11-23 12:08:44,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1865#false} is VALID [2018-11-23 12:08:44,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {1865#false} is VALID [2018-11-23 12:08:44,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {1865#false} assume !(~i~0 < 100000); {1865#false} is VALID [2018-11-23 12:08:44,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {1865#false} ~i~0 := 1;~j~0 := 0; {1865#false} is VALID [2018-11-23 12:08:44,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {1865#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {1865#false} is VALID [2018-11-23 12:08:44,930 INFO L256 TraceCheckUtils]: 23: Hoare triple {1865#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1865#false} is VALID [2018-11-23 12:08:44,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {1865#false} ~cond := #in~cond; {1865#false} is VALID [2018-11-23 12:08:44,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {1865#false} assume 0 == ~cond; {1865#false} is VALID [2018-11-23 12:08:44,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {1865#false} assume !false; {1865#false} is VALID [2018-11-23 12:08:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:08:44,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 12:08:44,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:44,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:08:44,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:44,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:08:44,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:08:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:08:44,984 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 13 states. [2018-11-23 12:08:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:45,231 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 12:08:45,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:08:45,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-23 12:08:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:08:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-23 12:08:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:08:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-23 12:08:45,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2018-11-23 12:08:45,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:45,307 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:08:45,307 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:08:45,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:08:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:08:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-11-23 12:08:45,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:45,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2018-11-23 12:08:45,328 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2018-11-23 12:08:45,328 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2018-11-23 12:08:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:45,331 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:08:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:08:45,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:45,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:45,332 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2018-11-23 12:08:45,332 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2018-11-23 12:08:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:45,334 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 12:08:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 12:08:45,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:45,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:45,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:45,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:08:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 12:08:45,336 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2018-11-23 12:08:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:45,336 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 12:08:45,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:08:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 12:08:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:08:45,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:45,337 INFO L402 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:45,337 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:45,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2083735689, now seen corresponding path program 8 times [2018-11-23 12:08:45,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:45,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:45,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:45,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:45,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-23 12:08:45,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2173#true} is VALID [2018-11-23 12:08:45,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-23 12:08:45,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #60#return; {2173#true} is VALID [2018-11-23 12:08:45,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret4 := main(); {2173#true} is VALID [2018-11-23 12:08:45,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2175#(= main_~i~0 0)} is VALID [2018-11-23 12:08:45,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {2175#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2176#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {2176#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2177#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {2177#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2178#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {2178#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2179#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {2179#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2180#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {2180#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2181#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {2181#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2182#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {2182#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2183#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {2183#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2184#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {2184#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2185#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {2185#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2174#false} is VALID [2018-11-23 12:08:45,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {2174#false} ~i~0 := 1; {2174#false} is VALID [2018-11-23 12:08:45,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2174#false} is VALID [2018-11-23 12:08:45,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2174#false} is VALID [2018-11-23 12:08:45,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2174#false} is VALID [2018-11-23 12:08:45,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {2174#false} assume !(~i~0 < 100000); {2174#false} is VALID [2018-11-23 12:08:45,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {2174#false} ~i~0 := 1;~j~0 := 0; {2174#false} is VALID [2018-11-23 12:08:45,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {2174#false} is VALID [2018-11-23 12:08:45,588 INFO L256 TraceCheckUtils]: 24: Hoare triple {2174#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2174#false} is VALID [2018-11-23 12:08:45,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2018-11-23 12:08:45,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2018-11-23 12:08:45,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-23 12:08:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:45,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:45,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:45,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:45,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:45,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:45,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:45,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2018-11-23 12:08:45,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2173#true} is VALID [2018-11-23 12:08:45,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {2173#true} assume true; {2173#true} is VALID [2018-11-23 12:08:45,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2173#true} {2173#true} #60#return; {2173#true} is VALID [2018-11-23 12:08:45,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {2173#true} call #t~ret4 := main(); {2173#true} is VALID [2018-11-23 12:08:45,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {2173#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2204#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:45,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {2204#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2176#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:45,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {2176#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2177#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:45,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {2177#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2178#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:45,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {2178#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2179#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:45,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {2179#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2180#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:45,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {2180#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2181#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:45,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {2181#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2182#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:45,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {2182#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2183#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:45,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {2183#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2184#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:45,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {2184#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2185#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:45,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {2185#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2174#false} is VALID [2018-11-23 12:08:45,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {2174#false} ~i~0 := 1; {2174#false} is VALID [2018-11-23 12:08:45,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2174#false} is VALID [2018-11-23 12:08:45,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2174#false} is VALID [2018-11-23 12:08:45,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2174#false} is VALID [2018-11-23 12:08:45,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {2174#false} assume !(~i~0 < 100000); {2174#false} is VALID [2018-11-23 12:08:45,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {2174#false} ~i~0 := 1;~j~0 := 0; {2174#false} is VALID [2018-11-23 12:08:45,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {2174#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {2174#false} is VALID [2018-11-23 12:08:45,839 INFO L256 TraceCheckUtils]: 24: Hoare triple {2174#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2174#false} is VALID [2018-11-23 12:08:45,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2018-11-23 12:08:45,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2018-11-23 12:08:45,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2018-11-23 12:08:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:45,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:45,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:08:45,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 12:08:45,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:45,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:08:45,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:45,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:08:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:08:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:08:45,895 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2018-11-23 12:08:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:46,598 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-23 12:08:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:08:46,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 12:08:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:08:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 12:08:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:08:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 12:08:46,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-23 12:08:46,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:46,664 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:08:46,664 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:08:46,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:08:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:08:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-23 12:08:46,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:46,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 33 states. [2018-11-23 12:08:46,720 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 33 states. [2018-11-23 12:08:46,720 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 33 states. [2018-11-23 12:08:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:46,721 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:08:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:08:46,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:46,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:46,722 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states. [2018-11-23 12:08:46,722 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states. [2018-11-23 12:08:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:46,723 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:08:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:08:46,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:46,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:46,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:46,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:08:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:08:46,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2018-11-23 12:08:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:46,725 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:08:46,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:08:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:08:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:08:46,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:46,726 INFO L402 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:46,726 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:46,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:46,727 INFO L82 PathProgramCache]: Analyzing trace with hash -20205851, now seen corresponding path program 9 times [2018-11-23 12:08:46,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:46,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:46,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:47,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {2492#true} call ULTIMATE.init(); {2492#true} is VALID [2018-11-23 12:08:47,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {2492#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2492#true} is VALID [2018-11-23 12:08:47,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {2492#true} assume true; {2492#true} is VALID [2018-11-23 12:08:47,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2492#true} {2492#true} #60#return; {2492#true} is VALID [2018-11-23 12:08:47,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {2492#true} call #t~ret4 := main(); {2492#true} is VALID [2018-11-23 12:08:47,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {2492#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2494#(= main_~i~0 0)} is VALID [2018-11-23 12:08:47,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {2494#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2495#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:47,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {2495#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2496#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:47,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {2496#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2497#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:47,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {2497#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2498#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:47,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {2498#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2499#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:47,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {2499#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2500#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:47,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {2500#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2501#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:47,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {2501#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2502#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:47,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {2502#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2503#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:47,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {2503#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2504#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:47,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {2504#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2505#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:47,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {2505#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2493#false} is VALID [2018-11-23 12:08:47,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {2493#false} ~i~0 := 1; {2493#false} is VALID [2018-11-23 12:08:47,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {2493#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2493#false} is VALID [2018-11-23 12:08:47,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {2493#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2493#false} is VALID [2018-11-23 12:08:47,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {2493#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2493#false} is VALID [2018-11-23 12:08:47,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {2493#false} assume !(~i~0 < 100000); {2493#false} is VALID [2018-11-23 12:08:47,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {2493#false} ~i~0 := 1;~j~0 := 0; {2493#false} is VALID [2018-11-23 12:08:47,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {2493#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {2493#false} is VALID [2018-11-23 12:08:47,045 INFO L256 TraceCheckUtils]: 25: Hoare triple {2493#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2493#false} is VALID [2018-11-23 12:08:47,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {2493#false} ~cond := #in~cond; {2493#false} is VALID [2018-11-23 12:08:47,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {2493#false} assume 0 == ~cond; {2493#false} is VALID [2018-11-23 12:08:47,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {2493#false} assume !false; {2493#false} is VALID [2018-11-23 12:08:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:08:47,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:47,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:47,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:47,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:08:47,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:47,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:47,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {2492#true} call ULTIMATE.init(); {2492#true} is VALID [2018-11-23 12:08:47,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {2492#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2492#true} is VALID [2018-11-23 12:08:47,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {2492#true} assume true; {2492#true} is VALID [2018-11-23 12:08:47,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2492#true} {2492#true} #60#return; {2492#true} is VALID [2018-11-23 12:08:47,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {2492#true} call #t~ret4 := main(); {2492#true} is VALID [2018-11-23 12:08:47,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {2492#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2492#true} is VALID [2018-11-23 12:08:47,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {2492#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2492#true} is VALID [2018-11-23 12:08:47,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {2492#true} assume !(~i~0 < 100000); {2492#true} is VALID [2018-11-23 12:08:47,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {2492#true} ~i~0 := 1; {2495#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:47,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {2495#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2500#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:47,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {2500#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2505#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:47,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {2505#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2572#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:47,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {2572#(<= main_~i~0 16)} assume !(~i~0 < 100000); {2493#false} is VALID [2018-11-23 12:08:47,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {2493#false} ~i~0 := 1;~j~0 := 0; {2493#false} is VALID [2018-11-23 12:08:47,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {2493#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {2493#false} is VALID [2018-11-23 12:08:47,180 INFO L256 TraceCheckUtils]: 25: Hoare triple {2493#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2493#false} is VALID [2018-11-23 12:08:47,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {2493#false} ~cond := #in~cond; {2493#false} is VALID [2018-11-23 12:08:47,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {2493#false} assume 0 == ~cond; {2493#false} is VALID [2018-11-23 12:08:47,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {2493#false} assume !false; {2493#false} is VALID [2018-11-23 12:08:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:08:47,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:47,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 15 [2018-11-23 12:08:47,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 12:08:47,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:47,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:08:47,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:47,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:08:47,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:08:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:08:47,280 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 15 states. [2018-11-23 12:08:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,740 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-23 12:08:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:08:47,741 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-11-23 12:08:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:08:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2018-11-23 12:08:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:08:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 70 transitions. [2018-11-23 12:08:47,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 70 transitions. [2018-11-23 12:08:47,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:47,816 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:08:47,817 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:08:47,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:08:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:08:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-11-23 12:08:47,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:47,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 36 states. [2018-11-23 12:08:47,870 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 36 states. [2018-11-23 12:08:47,870 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 36 states. [2018-11-23 12:08:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,872 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:08:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:08:47,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:47,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:47,873 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 48 states. [2018-11-23 12:08:47,873 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 48 states. [2018-11-23 12:08:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:47,875 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 12:08:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 12:08:47,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:47,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:47,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:47,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:08:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 12:08:47,877 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2018-11-23 12:08:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:47,877 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 12:08:47,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:08:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 12:08:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:08:47,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:47,878 INFO L402 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:47,878 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:47,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:47,879 INFO L82 PathProgramCache]: Analyzing trace with hash 527833994, now seen corresponding path program 10 times [2018-11-23 12:08:47,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:47,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:47,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:47,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:47,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:48,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {2855#true} call ULTIMATE.init(); {2855#true} is VALID [2018-11-23 12:08:48,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {2855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2855#true} is VALID [2018-11-23 12:08:48,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {2855#true} assume true; {2855#true} is VALID [2018-11-23 12:08:48,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} #60#return; {2855#true} is VALID [2018-11-23 12:08:48,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {2855#true} call #t~ret4 := main(); {2855#true} is VALID [2018-11-23 12:08:48,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {2855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2857#(= main_~i~0 0)} is VALID [2018-11-23 12:08:48,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {2857#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2858#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:48,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {2858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2859#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:48,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {2859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2860#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:48,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {2860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2861#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:48,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {2861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2862#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:48,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {2862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2863#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:48,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {2863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2864#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:48,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {2864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2865#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:48,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {2865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2866#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:48,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {2866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2867#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:48,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {2867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2868#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:48,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {2868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2869#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:48,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {2869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2870#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:48,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {2870#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2856#false} is VALID [2018-11-23 12:08:48,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {2856#false} ~i~0 := 1; {2856#false} is VALID [2018-11-23 12:08:48,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,320 INFO L273 TraceCheckUtils]: 23: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {2856#false} assume !(~i~0 < 100000); {2856#false} is VALID [2018-11-23 12:08:48,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {2856#false} ~i~0 := 1;~j~0 := 0; {2856#false} is VALID [2018-11-23 12:08:48,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {2856#false} is VALID [2018-11-23 12:08:48,321 INFO L256 TraceCheckUtils]: 28: Hoare triple {2856#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2856#false} is VALID [2018-11-23 12:08:48,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {2856#false} ~cond := #in~cond; {2856#false} is VALID [2018-11-23 12:08:48,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {2856#false} assume 0 == ~cond; {2856#false} is VALID [2018-11-23 12:08:48,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {2856#false} assume !false; {2856#false} is VALID [2018-11-23 12:08:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:48,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:48,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:48,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:48,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:48,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:48,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {2855#true} call ULTIMATE.init(); {2855#true} is VALID [2018-11-23 12:08:48,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {2855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2855#true} is VALID [2018-11-23 12:08:48,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {2855#true} assume true; {2855#true} is VALID [2018-11-23 12:08:48,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} #60#return; {2855#true} is VALID [2018-11-23 12:08:48,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {2855#true} call #t~ret4 := main(); {2855#true} is VALID [2018-11-23 12:08:48,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {2855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {2889#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:48,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {2889#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2858#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:48,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {2858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2859#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:48,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {2859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2860#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:48,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {2860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2861#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:48,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {2861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2862#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:48,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {2862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2863#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:48,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {2863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2864#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:48,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {2864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2865#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:48,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {2865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2866#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:48,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {2866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2867#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:48,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {2867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2868#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:48,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {2868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2869#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:48,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {2869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {2870#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:48,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {2870#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2856#false} is VALID [2018-11-23 12:08:48,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {2856#false} ~i~0 := 1; {2856#false} is VALID [2018-11-23 12:08:48,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {2856#false} is VALID [2018-11-23 12:08:48,551 INFO L273 TraceCheckUtils]: 25: Hoare triple {2856#false} assume !(~i~0 < 100000); {2856#false} is VALID [2018-11-23 12:08:48,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {2856#false} ~i~0 := 1;~j~0 := 0; {2856#false} is VALID [2018-11-23 12:08:48,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {2856#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {2856#false} is VALID [2018-11-23 12:08:48,552 INFO L256 TraceCheckUtils]: 28: Hoare triple {2856#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2856#false} is VALID [2018-11-23 12:08:48,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {2856#false} ~cond := #in~cond; {2856#false} is VALID [2018-11-23 12:08:48,552 INFO L273 TraceCheckUtils]: 30: Hoare triple {2856#false} assume 0 == ~cond; {2856#false} is VALID [2018-11-23 12:08:48,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {2856#false} assume !false; {2856#false} is VALID [2018-11-23 12:08:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:48,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:48,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:08:48,573 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 12:08:48,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:48,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:08:48,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:48,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:08:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:08:48,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:08:48,614 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 17 states. [2018-11-23 12:08:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:49,141 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-23 12:08:49,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:08:49,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 12:08:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:08:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2018-11-23 12:08:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:08:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2018-11-23 12:08:49,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2018-11-23 12:08:49,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:49,210 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:08:49,211 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:08:49,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:08:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:08:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-23 12:08:49,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:49,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 37 states. [2018-11-23 12:08:49,259 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 37 states. [2018-11-23 12:08:49,259 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 37 states. [2018-11-23 12:08:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:49,260 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:08:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:08:49,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:49,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:49,261 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 46 states. [2018-11-23 12:08:49,261 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 46 states. [2018-11-23 12:08:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:49,263 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 12:08:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 12:08:49,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:49,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:49,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:49,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:08:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 12:08:49,265 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2018-11-23 12:08:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:49,265 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 12:08:49,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:08:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 12:08:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:08:49,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:49,266 INFO L402 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:49,266 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 947647462, now seen corresponding path program 11 times [2018-11-23 12:08:49,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:49,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:49,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:49,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {3226#true} call ULTIMATE.init(); {3226#true} is VALID [2018-11-23 12:08:49,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {3226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3226#true} is VALID [2018-11-23 12:08:49,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {3226#true} assume true; {3226#true} is VALID [2018-11-23 12:08:49,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3226#true} {3226#true} #60#return; {3226#true} is VALID [2018-11-23 12:08:49,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {3226#true} call #t~ret4 := main(); {3226#true} is VALID [2018-11-23 12:08:49,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {3226#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3228#(= main_~i~0 0)} is VALID [2018-11-23 12:08:49,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {3228#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3229#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:49,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {3229#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3230#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:49,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {3230#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3231#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:49,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {3231#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3232#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:49,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3233#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:49,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {3233#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3234#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:49,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {3234#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3235#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:49,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {3235#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3236#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:49,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {3236#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3237#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:49,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {3237#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3238#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:49,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {3238#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3239#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:49,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {3239#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3240#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:49,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {3240#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3241#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:49,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {3241#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:49,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {3242#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3227#false} is VALID [2018-11-23 12:08:49,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {3227#false} ~i~0 := 1; {3227#false} is VALID [2018-11-23 12:08:49,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:49,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:49,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:49,654 INFO L273 TraceCheckUtils]: 25: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:49,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {3227#false} assume !(~i~0 < 100000); {3227#false} is VALID [2018-11-23 12:08:49,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {3227#false} ~i~0 := 1;~j~0 := 0; {3227#false} is VALID [2018-11-23 12:08:49,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {3227#false} is VALID [2018-11-23 12:08:49,655 INFO L256 TraceCheckUtils]: 29: Hoare triple {3227#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3227#false} is VALID [2018-11-23 12:08:49,656 INFO L273 TraceCheckUtils]: 30: Hoare triple {3227#false} ~cond := #in~cond; {3227#false} is VALID [2018-11-23 12:08:49,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {3227#false} assume 0 == ~cond; {3227#false} is VALID [2018-11-23 12:08:49,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {3227#false} assume !false; {3227#false} is VALID [2018-11-23 12:08:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:49,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:49,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:49,670 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:49,949 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 12:08:49,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:49,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:50,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {3226#true} call ULTIMATE.init(); {3226#true} is VALID [2018-11-23 12:08:50,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {3226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3226#true} is VALID [2018-11-23 12:08:50,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {3226#true} assume true; {3226#true} is VALID [2018-11-23 12:08:50,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3226#true} {3226#true} #60#return; {3226#true} is VALID [2018-11-23 12:08:50,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {3226#true} call #t~ret4 := main(); {3226#true} is VALID [2018-11-23 12:08:50,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {3226#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3261#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:50,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {3261#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3229#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:50,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {3229#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3230#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:50,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {3230#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3231#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:50,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {3231#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3232#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:50,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3233#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:50,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {3233#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3234#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:50,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {3234#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3235#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:50,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {3235#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3236#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:50,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {3236#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3237#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:50,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {3237#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3238#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:50,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {3238#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3239#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:50,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {3239#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3240#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:50,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {3240#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3241#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:50,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {3241#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3242#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:50,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {3242#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3227#false} is VALID [2018-11-23 12:08:50,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {3227#false} ~i~0 := 1; {3227#false} is VALID [2018-11-23 12:08:50,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:50,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:50,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:50,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3227#false} is VALID [2018-11-23 12:08:50,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {3227#false} assume !(~i~0 < 100000); {3227#false} is VALID [2018-11-23 12:08:50,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {3227#false} ~i~0 := 1;~j~0 := 0; {3227#false} is VALID [2018-11-23 12:08:50,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {3227#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {3227#false} is VALID [2018-11-23 12:08:50,120 INFO L256 TraceCheckUtils]: 29: Hoare triple {3227#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3227#false} is VALID [2018-11-23 12:08:50,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {3227#false} ~cond := #in~cond; {3227#false} is VALID [2018-11-23 12:08:50,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {3227#false} assume 0 == ~cond; {3227#false} is VALID [2018-11-23 12:08:50,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {3227#false} assume !false; {3227#false} is VALID [2018-11-23 12:08:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:50,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:50,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:08:50,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-11-23 12:08:50,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:50,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:08:50,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:50,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:08:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:08:50,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:08:50,179 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 18 states. [2018-11-23 12:08:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:50,566 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 12:08:50,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:08:50,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-11-23 12:08:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:08:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2018-11-23 12:08:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:08:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2018-11-23 12:08:50,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2018-11-23 12:08:50,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:50,644 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:08:50,644 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:08:50,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 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 12:08:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:08:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2018-11-23 12:08:50,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:50,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 38 states. [2018-11-23 12:08:50,678 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 38 states. [2018-11-23 12:08:50,679 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 38 states. [2018-11-23 12:08:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:50,680 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 12:08:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 12:08:50,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:50,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:50,681 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 47 states. [2018-11-23 12:08:50,681 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 47 states. [2018-11-23 12:08:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:50,683 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 12:08:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 12:08:50,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:50,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:50,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:50,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:08:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 12:08:50,686 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-11-23 12:08:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:50,686 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 12:08:50,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:08:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 12:08:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:08:50,687 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:50,687 INFO L402 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:50,687 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:50,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1076963082, now seen corresponding path program 12 times [2018-11-23 12:08:50,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:50,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:51,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {3607#true} call ULTIMATE.init(); {3607#true} is VALID [2018-11-23 12:08:51,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {3607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3607#true} is VALID [2018-11-23 12:08:51,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-23 12:08:51,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3607#true} {3607#true} #60#return; {3607#true} is VALID [2018-11-23 12:08:51,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {3607#true} call #t~ret4 := main(); {3607#true} is VALID [2018-11-23 12:08:51,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {3607#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3609#(= main_~i~0 0)} is VALID [2018-11-23 12:08:51,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {3609#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3610#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:51,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {3610#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3611#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:51,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {3611#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3612#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:51,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3613#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:51,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3614#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:51,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {3614#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3615#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:51,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {3615#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3616#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:51,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {3616#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3617#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:51,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {3617#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3618#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:51,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {3618#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3619#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:51,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {3619#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3620#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:51,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {3620#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3621#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:51,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {3621#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3622#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:51,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {3622#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3623#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:51,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {3623#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3624#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:51,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {3624#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-23 12:08:51,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {3608#false} ~i~0 := 1; {3608#false} is VALID [2018-11-23 12:08:51,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3608#false} is VALID [2018-11-23 12:08:51,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3608#false} is VALID [2018-11-23 12:08:51,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3608#false} is VALID [2018-11-23 12:08:51,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3608#false} is VALID [2018-11-23 12:08:51,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {3608#false} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-23 12:08:51,057 INFO L273 TraceCheckUtils]: 28: Hoare triple {3608#false} ~i~0 := 1;~j~0 := 0; {3608#false} is VALID [2018-11-23 12:08:51,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {3608#false} is VALID [2018-11-23 12:08:51,057 INFO L256 TraceCheckUtils]: 30: Hoare triple {3608#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3608#false} is VALID [2018-11-23 12:08:51,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {3608#false} ~cond := #in~cond; {3608#false} is VALID [2018-11-23 12:08:51,058 INFO L273 TraceCheckUtils]: 32: Hoare triple {3608#false} assume 0 == ~cond; {3608#false} is VALID [2018-11-23 12:08:51,058 INFO L273 TraceCheckUtils]: 33: Hoare triple {3608#false} assume !false; {3608#false} is VALID [2018-11-23 12:08:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 12:08:51,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:51,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:51,072 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:08:51,103 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:08:51,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:51,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:51,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {3607#true} call ULTIMATE.init(); {3607#true} is VALID [2018-11-23 12:08:51,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {3607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3607#true} is VALID [2018-11-23 12:08:51,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {3607#true} assume true; {3607#true} is VALID [2018-11-23 12:08:51,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3607#true} {3607#true} #60#return; {3607#true} is VALID [2018-11-23 12:08:51,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {3607#true} call #t~ret4 := main(); {3607#true} is VALID [2018-11-23 12:08:51,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {3607#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {3607#true} is VALID [2018-11-23 12:08:51,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {3607#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {3607#true} is VALID [2018-11-23 12:08:51,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {3607#true} assume !(~i~0 < 100000); {3607#true} is VALID [2018-11-23 12:08:51,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {3607#true} ~i~0 := 1; {3610#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:51,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {3610#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3615#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:51,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {3615#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3620#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:51,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {3620#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3703#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:51,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {3703#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {3707#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:51,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {3707#(<= main_~i~0 21)} assume !(~i~0 < 100000); {3608#false} is VALID [2018-11-23 12:08:51,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {3608#false} ~i~0 := 1;~j~0 := 0; {3608#false} is VALID [2018-11-23 12:08:51,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {3608#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {3608#false} is VALID [2018-11-23 12:08:51,242 INFO L256 TraceCheckUtils]: 30: Hoare triple {3608#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3608#false} is VALID [2018-11-23 12:08:51,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {3608#false} ~cond := #in~cond; {3608#false} is VALID [2018-11-23 12:08:51,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {3608#false} assume 0 == ~cond; {3608#false} is VALID [2018-11-23 12:08:51,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {3608#false} assume !false; {3608#false} is VALID [2018-11-23 12:08:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-23 12:08:51,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:51,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 20 [2018-11-23 12:08:51,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-11-23 12:08:51,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:51,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:08:51,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:51,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:08:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:08:51,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:08:51,326 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2018-11-23 12:08:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:52,007 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-23 12:08:52,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:08:52,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-11-23 12:08:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:08:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 81 transitions. [2018-11-23 12:08:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:08:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 81 transitions. [2018-11-23 12:08:52,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 81 transitions. [2018-11-23 12:08:52,094 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 12:08:52,096 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:08:52,096 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:08:52,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:08:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:08:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-11-23 12:08:52,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:52,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 42 states. [2018-11-23 12:08:52,127 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 42 states. [2018-11-23 12:08:52,127 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 42 states. [2018-11-23 12:08:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:52,129 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:08:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:08:52,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:52,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:52,130 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 57 states. [2018-11-23 12:08:52,130 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 57 states. [2018-11-23 12:08:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:52,131 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-23 12:08:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-23 12:08:52,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:52,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:52,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:52,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:08:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 12:08:52,133 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 34 [2018-11-23 12:08:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:52,133 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 12:08:52,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:08:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 12:08:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:08:52,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:52,134 INFO L402 BasicCegarLoop]: trace histogram [18, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:52,134 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:52,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 607519273, now seen corresponding path program 13 times [2018-11-23 12:08:52,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:52,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:52,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:52,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4039#true} is VALID [2018-11-23 12:08:52,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {4039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4039#true} is VALID [2018-11-23 12:08:52,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2018-11-23 12:08:52,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #60#return; {4039#true} is VALID [2018-11-23 12:08:52,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret4 := main(); {4039#true} is VALID [2018-11-23 12:08:52,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {4039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4041#(= main_~i~0 0)} is VALID [2018-11-23 12:08:52,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {4041#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4042#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:52,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {4042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4043#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:52,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {4043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4044#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:52,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {4044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4045#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:52,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {4045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4046#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:52,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {4046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4047#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:52,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {4047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4048#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:52,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {4048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4049#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:52,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {4049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4050#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:52,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {4050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4051#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:52,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {4051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4052#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:52,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {4052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4053#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:52,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {4053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4054#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:52,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {4054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4055#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:52,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {4055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4056#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:52,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {4056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4057#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:52,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {4057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4058#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:52,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {4058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4059#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:52,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {4059#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4040#false} is VALID [2018-11-23 12:08:52,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {4040#false} ~i~0 := 1; {4040#false} is VALID [2018-11-23 12:08:52,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {4040#false} assume !(~i~0 < 100000); {4040#false} is VALID [2018-11-23 12:08:52,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {4040#false} ~i~0 := 1;~j~0 := 0; {4040#false} is VALID [2018-11-23 12:08:52,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {4040#false} is VALID [2018-11-23 12:08:52,611 INFO L256 TraceCheckUtils]: 34: Hoare triple {4040#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4040#false} is VALID [2018-11-23 12:08:52,611 INFO L273 TraceCheckUtils]: 35: Hoare triple {4040#false} ~cond := #in~cond; {4040#false} is VALID [2018-11-23 12:08:52,611 INFO L273 TraceCheckUtils]: 36: Hoare triple {4040#false} assume 0 == ~cond; {4040#false} is VALID [2018-11-23 12:08:52,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2018-11-23 12:08:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:52,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:52,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:52,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:52,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:52,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {4039#true} call ULTIMATE.init(); {4039#true} is VALID [2018-11-23 12:08:52,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {4039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4039#true} is VALID [2018-11-23 12:08:52,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {4039#true} assume true; {4039#true} is VALID [2018-11-23 12:08:52,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4039#true} {4039#true} #60#return; {4039#true} is VALID [2018-11-23 12:08:52,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {4039#true} call #t~ret4 := main(); {4039#true} is VALID [2018-11-23 12:08:52,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {4039#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4078#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:52,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {4078#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4042#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:52,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {4042#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4043#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:52,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {4043#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4044#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:52,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {4044#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4045#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:52,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {4045#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4046#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:52,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {4046#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4047#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:52,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {4047#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4048#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:52,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {4048#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4049#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:52,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {4049#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4050#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:52,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {4050#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4051#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:52,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {4051#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4052#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:52,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {4052#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4053#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:52,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {4053#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4054#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:52,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {4054#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4055#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:52,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {4055#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4056#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:52,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {4056#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4057#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:52,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {4057#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4058#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:52,825 INFO L273 TraceCheckUtils]: 23: Hoare triple {4058#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4059#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:52,826 INFO L273 TraceCheckUtils]: 24: Hoare triple {4059#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4040#false} is VALID [2018-11-23 12:08:52,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {4040#false} ~i~0 := 1; {4040#false} is VALID [2018-11-23 12:08:52,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,827 INFO L273 TraceCheckUtils]: 28: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,827 INFO L273 TraceCheckUtils]: 29: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,827 INFO L273 TraceCheckUtils]: 30: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4040#false} is VALID [2018-11-23 12:08:52,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {4040#false} assume !(~i~0 < 100000); {4040#false} is VALID [2018-11-23 12:08:52,828 INFO L273 TraceCheckUtils]: 32: Hoare triple {4040#false} ~i~0 := 1;~j~0 := 0; {4040#false} is VALID [2018-11-23 12:08:52,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {4040#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {4040#false} is VALID [2018-11-23 12:08:52,828 INFO L256 TraceCheckUtils]: 34: Hoare triple {4040#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4040#false} is VALID [2018-11-23 12:08:52,828 INFO L273 TraceCheckUtils]: 35: Hoare triple {4040#false} ~cond := #in~cond; {4040#false} is VALID [2018-11-23 12:08:52,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {4040#false} assume 0 == ~cond; {4040#false} is VALID [2018-11-23 12:08:52,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {4040#false} assume !false; {4040#false} is VALID [2018-11-23 12:08:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:52,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:52,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:08:52,849 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-11-23 12:08:52,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:52,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:08:52,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:52,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:08:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:08:52,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:08:52,886 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 22 states. [2018-11-23 12:08:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:53,483 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-23 12:08:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:08:53,483 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-11-23 12:08:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:08:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 74 transitions. [2018-11-23 12:08:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:08:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 74 transitions. [2018-11-23 12:08:53,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 74 transitions. [2018-11-23 12:08:53,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:53,876 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:08:53,877 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:08:53,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:08:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:08:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-11-23 12:08:53,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:53,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 43 states. [2018-11-23 12:08:53,997 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 43 states. [2018-11-23 12:08:53,997 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 43 states. [2018-11-23 12:08:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:54,000 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 12:08:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-23 12:08:54,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:54,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:54,000 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 55 states. [2018-11-23 12:08:54,000 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 55 states. [2018-11-23 12:08:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:54,002 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 12:08:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-23 12:08:54,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:54,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:54,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:54,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:08:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 12:08:54,004 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2018-11-23 12:08:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 12:08:54,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:08:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 12:08:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:08:54,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:54,005 INFO L402 BasicCegarLoop]: trace histogram [19, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:54,005 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -365484667, now seen corresponding path program 14 times [2018-11-23 12:08:54,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:54,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:54,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:54,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {4482#true} call ULTIMATE.init(); {4482#true} is VALID [2018-11-23 12:08:54,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {4482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4482#true} is VALID [2018-11-23 12:08:54,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {4482#true} assume true; {4482#true} is VALID [2018-11-23 12:08:54,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4482#true} {4482#true} #60#return; {4482#true} is VALID [2018-11-23 12:08:54,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {4482#true} call #t~ret4 := main(); {4482#true} is VALID [2018-11-23 12:08:54,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {4482#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4484#(= main_~i~0 0)} is VALID [2018-11-23 12:08:54,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {4484#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4485#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:54,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {4485#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4486#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:54,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {4486#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4487#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:54,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {4487#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4488#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:54,766 INFO L273 TraceCheckUtils]: 10: Hoare triple {4488#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4489#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:54,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {4489#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4490#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:54,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {4490#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4491#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:54,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {4491#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4492#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:54,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {4492#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4493#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:54,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {4493#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4494#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:54,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {4494#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4495#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:54,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {4495#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4496#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:54,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {4496#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4497#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:54,775 INFO L273 TraceCheckUtils]: 19: Hoare triple {4497#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4498#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:54,776 INFO L273 TraceCheckUtils]: 20: Hoare triple {4498#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4499#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:54,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {4499#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4500#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:54,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {4500#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4501#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:54,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {4501#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4502#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:54,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {4502#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4503#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:54,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {4503#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4483#false} is VALID [2018-11-23 12:08:54,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {4483#false} ~i~0 := 1; {4483#false} is VALID [2018-11-23 12:08:54,781 INFO L273 TraceCheckUtils]: 27: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:54,781 INFO L273 TraceCheckUtils]: 28: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:54,782 INFO L273 TraceCheckUtils]: 29: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:54,782 INFO L273 TraceCheckUtils]: 30: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:54,782 INFO L273 TraceCheckUtils]: 31: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:54,782 INFO L273 TraceCheckUtils]: 32: Hoare triple {4483#false} assume !(~i~0 < 100000); {4483#false} is VALID [2018-11-23 12:08:54,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {4483#false} ~i~0 := 1;~j~0 := 0; {4483#false} is VALID [2018-11-23 12:08:54,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {4483#false} is VALID [2018-11-23 12:08:54,783 INFO L256 TraceCheckUtils]: 35: Hoare triple {4483#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4483#false} is VALID [2018-11-23 12:08:54,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {4483#false} ~cond := #in~cond; {4483#false} is VALID [2018-11-23 12:08:54,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {4483#false} assume 0 == ~cond; {4483#false} is VALID [2018-11-23 12:08:54,783 INFO L273 TraceCheckUtils]: 38: Hoare triple {4483#false} assume !false; {4483#false} is VALID [2018-11-23 12:08:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:54,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:54,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:08:54,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:08:54,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:54,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:55,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {4482#true} call ULTIMATE.init(); {4482#true} is VALID [2018-11-23 12:08:55,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {4482#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4482#true} is VALID [2018-11-23 12:08:55,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {4482#true} assume true; {4482#true} is VALID [2018-11-23 12:08:55,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4482#true} {4482#true} #60#return; {4482#true} is VALID [2018-11-23 12:08:55,021 INFO L256 TraceCheckUtils]: 4: Hoare triple {4482#true} call #t~ret4 := main(); {4482#true} is VALID [2018-11-23 12:08:55,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {4482#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4522#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:55,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {4522#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4485#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:55,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {4485#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4486#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:55,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {4486#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4487#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:55,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {4487#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4488#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:55,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {4488#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4489#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:55,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {4489#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4490#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:55,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {4490#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4491#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:55,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {4491#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4492#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:55,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {4492#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4493#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:55,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {4493#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4494#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:55,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {4494#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4495#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:55,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {4495#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4496#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:55,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {4496#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4497#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:55,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {4497#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4498#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:55,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {4498#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4499#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:55,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {4499#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4500#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:55,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {4500#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4501#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:55,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {4501#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4502#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:55,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {4502#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4503#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:55,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {4503#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4483#false} is VALID [2018-11-23 12:08:55,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {4483#false} ~i~0 := 1; {4483#false} is VALID [2018-11-23 12:08:55,142 INFO L273 TraceCheckUtils]: 27: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:55,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:55,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:55,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:55,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4483#false} is VALID [2018-11-23 12:08:55,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {4483#false} assume !(~i~0 < 100000); {4483#false} is VALID [2018-11-23 12:08:55,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {4483#false} ~i~0 := 1;~j~0 := 0; {4483#false} is VALID [2018-11-23 12:08:55,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {4483#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {4483#false} is VALID [2018-11-23 12:08:55,143 INFO L256 TraceCheckUtils]: 35: Hoare triple {4483#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4483#false} is VALID [2018-11-23 12:08:55,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {4483#false} ~cond := #in~cond; {4483#false} is VALID [2018-11-23 12:08:55,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {4483#false} assume 0 == ~cond; {4483#false} is VALID [2018-11-23 12:08:55,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {4483#false} assume !false; {4483#false} is VALID [2018-11-23 12:08:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:55,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:55,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:08:55,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-11-23 12:08:55,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:55,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:08:55,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:55,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:08:55,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:08:55,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:08:55,196 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 23 states. [2018-11-23 12:08:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:55,988 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-23 12:08:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:08:55,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-11-23 12:08:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:08:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 75 transitions. [2018-11-23 12:08:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:08:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 75 transitions. [2018-11-23 12:08:55,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 75 transitions. [2018-11-23 12:08:56,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:56,943 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:08:56,943 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:08:56,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:08:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:08:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2018-11-23 12:08:57,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:57,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 44 states. [2018-11-23 12:08:57,084 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 44 states. [2018-11-23 12:08:57,084 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 44 states. [2018-11-23 12:08:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:57,086 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-23 12:08:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-23 12:08:57,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:57,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:57,087 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 56 states. [2018-11-23 12:08:57,087 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 56 states. [2018-11-23 12:08:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:57,088 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-23 12:08:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-23 12:08:57,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:57,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:57,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:57,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:08:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 12:08:57,091 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2018-11-23 12:08:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:57,091 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 12:08:57,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:08:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 12:08:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:08:57,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:57,092 INFO L402 BasicCegarLoop]: trace histogram [20, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:57,092 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:57,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash -463835735, now seen corresponding path program 15 times [2018-11-23 12:08:57,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:57,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:57,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:57,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:57,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:58,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {4935#true} call ULTIMATE.init(); {4935#true} is VALID [2018-11-23 12:08:58,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {4935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4935#true} is VALID [2018-11-23 12:08:58,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {4935#true} assume true; {4935#true} is VALID [2018-11-23 12:08:58,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4935#true} {4935#true} #60#return; {4935#true} is VALID [2018-11-23 12:08:58,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {4935#true} call #t~ret4 := main(); {4935#true} is VALID [2018-11-23 12:08:58,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {4935#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4937#(= main_~i~0 0)} is VALID [2018-11-23 12:08:58,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {4937#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4938#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:58,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {4938#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4939#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:58,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {4939#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4940#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:58,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {4940#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4941#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:58,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {4941#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4942#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:58,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {4942#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4943#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:58,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {4943#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4944#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:58,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {4944#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4945#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:58,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {4945#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4946#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:58,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {4946#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4947#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:58,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {4947#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4948#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:58,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {4948#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4949#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:58,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {4949#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4950#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:58,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {4950#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4951#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:58,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {4951#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4952#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:58,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {4952#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4953#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:58,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {4953#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4954#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:58,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {4954#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4955#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:58,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {4955#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4956#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:58,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {4956#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4957#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:58,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 20)} assume !(~i~0 < 100000); {4936#false} is VALID [2018-11-23 12:08:58,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {4936#false} ~i~0 := 1; {4936#false} is VALID [2018-11-23 12:08:58,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4936#false} is VALID [2018-11-23 12:08:58,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4936#false} is VALID [2018-11-23 12:08:58,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4936#false} is VALID [2018-11-23 12:08:58,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4936#false} is VALID [2018-11-23 12:08:58,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4936#false} is VALID [2018-11-23 12:08:58,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {4936#false} assume !(~i~0 < 100000); {4936#false} is VALID [2018-11-23 12:08:58,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {4936#false} ~i~0 := 1;~j~0 := 0; {4936#false} is VALID [2018-11-23 12:08:58,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {4936#false} is VALID [2018-11-23 12:08:58,271 INFO L256 TraceCheckUtils]: 36: Hoare triple {4936#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4936#false} is VALID [2018-11-23 12:08:58,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {4936#false} ~cond := #in~cond; {4936#false} is VALID [2018-11-23 12:08:58,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {4936#false} assume 0 == ~cond; {4936#false} is VALID [2018-11-23 12:08:58,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {4936#false} assume !false; {4936#false} is VALID [2018-11-23 12:08:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:08:58,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:58,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:58,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:58,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:08:58,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:58,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:58,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {4935#true} call ULTIMATE.init(); {4935#true} is VALID [2018-11-23 12:08:58,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {4935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4935#true} is VALID [2018-11-23 12:08:58,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {4935#true} assume true; {4935#true} is VALID [2018-11-23 12:08:58,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4935#true} {4935#true} #60#return; {4935#true} is VALID [2018-11-23 12:08:58,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {4935#true} call #t~ret4 := main(); {4935#true} is VALID [2018-11-23 12:08:58,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {4935#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {4935#true} is VALID [2018-11-23 12:08:58,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {4935#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {4935#true} is VALID [2018-11-23 12:08:58,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {4935#true} assume !(~i~0 < 100000); {4935#true} is VALID [2018-11-23 12:08:58,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {4935#true} ~i~0 := 1; {4938#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:58,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {4938#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4943#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:58,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {4943#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4948#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:58,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {4948#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {4953#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:58,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {4953#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5054#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:58,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {5054#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5058#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:58,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {5058#(<= main_~i~0 26)} assume !(~i~0 < 100000); {4936#false} is VALID [2018-11-23 12:08:58,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {4936#false} ~i~0 := 1;~j~0 := 0; {4936#false} is VALID [2018-11-23 12:08:58,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {4936#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {4936#false} is VALID [2018-11-23 12:08:58,482 INFO L256 TraceCheckUtils]: 36: Hoare triple {4936#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4936#false} is VALID [2018-11-23 12:08:58,482 INFO L273 TraceCheckUtils]: 37: Hoare triple {4936#false} ~cond := #in~cond; {4936#false} is VALID [2018-11-23 12:08:58,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {4936#false} assume 0 == ~cond; {4936#false} is VALID [2018-11-23 12:08:58,483 INFO L273 TraceCheckUtils]: 39: Hoare triple {4936#false} assume !false; {4936#false} is VALID [2018-11-23 12:08:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-23 12:08:58,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:58,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 25 [2018-11-23 12:08:58,504 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-11-23 12:08:58,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:58,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:08:58,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:58,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:08:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:08:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:08:58,589 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 25 states. [2018-11-23 12:08:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:59,357 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-11-23 12:08:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:08:59,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-11-23 12:08:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 91 transitions. [2018-11-23 12:08:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:08:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 91 transitions. [2018-11-23 12:08:59,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 91 transitions. [2018-11-23 12:08:59,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:59,454 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:08:59,455 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:08:59,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:08:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:08:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-11-23 12:08:59,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:59,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 48 states. [2018-11-23 12:08:59,591 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 48 states. [2018-11-23 12:08:59,591 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 48 states. [2018-11-23 12:08:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:59,593 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:08:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:08:59,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:59,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:59,594 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 66 states. [2018-11-23 12:08:59,594 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 66 states. [2018-11-23 12:08:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:59,596 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:08:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:08:59,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:59,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:59,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:59,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:08:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-23 12:08:59,598 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 40 [2018-11-23 12:08:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-23 12:08:59,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:08:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 12:08:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:08:59,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:59,599 INFO L402 BasicCegarLoop]: trace histogram [23, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:59,599 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:59,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 539739242, now seen corresponding path program 16 times [2018-11-23 12:08:59,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:59,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:59,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:00,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {5439#true} call ULTIMATE.init(); {5439#true} is VALID [2018-11-23 12:09:00,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {5439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5439#true} is VALID [2018-11-23 12:09:00,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {5439#true} assume true; {5439#true} is VALID [2018-11-23 12:09:00,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} #60#return; {5439#true} is VALID [2018-11-23 12:09:00,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {5439#true} call #t~ret4 := main(); {5439#true} is VALID [2018-11-23 12:09:00,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {5439#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5441#(= main_~i~0 0)} is VALID [2018-11-23 12:09:00,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {5441#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5442#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:00,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {5442#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5443#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:00,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {5443#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5444#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:00,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {5444#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5445#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:00,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {5445#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5446#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:00,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {5446#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5447#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:00,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {5447#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5448#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:00,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {5448#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5449#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:00,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {5449#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5450#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:00,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {5450#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5451#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:00,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {5451#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5452#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:00,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {5452#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5453#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:00,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {5453#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5454#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:00,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {5454#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5455#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:00,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {5455#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5456#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:00,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {5456#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5457#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:00,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {5457#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5458#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:00,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {5458#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5459#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:00,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {5459#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5460#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:00,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {5460#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5461#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:00,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {5461#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5462#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:00,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {5462#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5463#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:00,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {5463#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5464#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:00,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {5464#(<= main_~i~0 23)} assume !(~i~0 < 100000); {5440#false} is VALID [2018-11-23 12:09:00,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {5440#false} ~i~0 := 1; {5440#false} is VALID [2018-11-23 12:09:00,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {5440#false} assume !(~i~0 < 100000); {5440#false} is VALID [2018-11-23 12:09:00,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {5440#false} ~i~0 := 1;~j~0 := 0; {5440#false} is VALID [2018-11-23 12:09:00,438 INFO L273 TraceCheckUtils]: 39: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {5440#false} is VALID [2018-11-23 12:09:00,438 INFO L256 TraceCheckUtils]: 40: Hoare triple {5440#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5440#false} is VALID [2018-11-23 12:09:00,438 INFO L273 TraceCheckUtils]: 41: Hoare triple {5440#false} ~cond := #in~cond; {5440#false} is VALID [2018-11-23 12:09:00,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {5440#false} assume 0 == ~cond; {5440#false} is VALID [2018-11-23 12:09:00,439 INFO L273 TraceCheckUtils]: 43: Hoare triple {5440#false} assume !false; {5440#false} is VALID [2018-11-23 12:09:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:00,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:00,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:00,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:00,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:00,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:00,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:00,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {5439#true} call ULTIMATE.init(); {5439#true} is VALID [2018-11-23 12:09:00,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {5439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5439#true} is VALID [2018-11-23 12:09:00,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {5439#true} assume true; {5439#true} is VALID [2018-11-23 12:09:00,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} #60#return; {5439#true} is VALID [2018-11-23 12:09:00,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {5439#true} call #t~ret4 := main(); {5439#true} is VALID [2018-11-23 12:09:00,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {5439#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5483#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:00,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {5483#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5442#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:00,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {5442#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5443#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:00,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {5443#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5444#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:00,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {5444#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5445#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:00,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {5445#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5446#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:00,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {5446#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5447#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:00,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {5447#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5448#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:00,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {5448#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5449#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:00,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {5449#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5450#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:00,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {5450#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5451#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:00,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {5451#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5452#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:00,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {5452#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5453#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:00,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {5453#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5454#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:00,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {5454#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5455#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:00,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {5455#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5456#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:00,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {5456#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5457#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:00,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {5457#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5458#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:00,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {5458#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5459#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:00,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {5459#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5460#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:00,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {5460#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5461#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:00,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {5461#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5462#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:00,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {5462#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5463#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:00,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {5463#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5464#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:00,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {5464#(<= main_~i~0 23)} assume !(~i~0 < 100000); {5440#false} is VALID [2018-11-23 12:09:00,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {5440#false} ~i~0 := 1; {5440#false} is VALID [2018-11-23 12:09:00,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,768 INFO L273 TraceCheckUtils]: 32: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,768 INFO L273 TraceCheckUtils]: 33: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,768 INFO L273 TraceCheckUtils]: 34: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5440#false} is VALID [2018-11-23 12:09:00,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {5440#false} assume !(~i~0 < 100000); {5440#false} is VALID [2018-11-23 12:09:00,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {5440#false} ~i~0 := 1;~j~0 := 0; {5440#false} is VALID [2018-11-23 12:09:00,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {5440#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {5440#false} is VALID [2018-11-23 12:09:00,770 INFO L256 TraceCheckUtils]: 40: Hoare triple {5440#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5440#false} is VALID [2018-11-23 12:09:00,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {5440#false} ~cond := #in~cond; {5440#false} is VALID [2018-11-23 12:09:00,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {5440#false} assume 0 == ~cond; {5440#false} is VALID [2018-11-23 12:09:00,770 INFO L273 TraceCheckUtils]: 43: Hoare triple {5440#false} assume !false; {5440#false} is VALID [2018-11-23 12:09:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:09:00,791 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-11-23 12:09:00,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:00,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:09:00,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:00,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:09:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:09:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:09:00,824 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 27 states. [2018-11-23 12:09:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:01,573 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-23 12:09:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:09:01,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-11-23 12:09:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:09:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 84 transitions. [2018-11-23 12:09:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:09:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 84 transitions. [2018-11-23 12:09:01,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 84 transitions. [2018-11-23 12:09:01,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:01,659 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:09:01,659 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:09:01,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:09:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:09:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2018-11-23 12:09:01,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:01,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 49 states. [2018-11-23 12:09:01,747 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 49 states. [2018-11-23 12:09:01,747 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 49 states. [2018-11-23 12:09:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:01,749 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-23 12:09:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-23 12:09:01,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:01,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:01,750 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 64 states. [2018-11-23 12:09:01,750 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 64 states. [2018-11-23 12:09:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:01,752 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-23 12:09:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-11-23 12:09:01,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:01,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:01,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:01,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:09:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-11-23 12:09:01,754 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2018-11-23 12:09:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:01,754 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-11-23 12:09:01,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:09:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-23 12:09:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:09:01,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:01,755 INFO L402 BasicCegarLoop]: trace histogram [24, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:01,755 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:01,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash 507769542, now seen corresponding path program 17 times [2018-11-23 12:09:01,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:01,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:01,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:01,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:01,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:02,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {5954#true} call ULTIMATE.init(); {5954#true} is VALID [2018-11-23 12:09:02,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {5954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5954#true} is VALID [2018-11-23 12:09:02,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {5954#true} assume true; {5954#true} is VALID [2018-11-23 12:09:02,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5954#true} {5954#true} #60#return; {5954#true} is VALID [2018-11-23 12:09:02,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {5954#true} call #t~ret4 := main(); {5954#true} is VALID [2018-11-23 12:09:02,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {5954#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5956#(= main_~i~0 0)} is VALID [2018-11-23 12:09:02,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {5956#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5957#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:02,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {5957#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5958#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:02,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {5958#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5959#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:02,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {5959#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5960#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:02,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {5960#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5961#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:02,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {5961#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5962#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:02,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {5962#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5963#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:02,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {5963#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5964#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:02,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {5964#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5965#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:02,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {5965#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5966#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:02,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {5966#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5967#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:02,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {5967#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5968#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:02,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {5968#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5969#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:02,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {5969#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5970#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:02,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {5970#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5971#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:02,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {5971#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5972#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:02,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {5972#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5973#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:02,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {5973#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5974#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:02,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {5974#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5975#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:02,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {5975#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5976#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:02,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {5976#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5977#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:02,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {5977#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5978#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:02,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {5978#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5979#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:02,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {5979#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5980#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:02,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {5980#(<= main_~i~0 24)} assume !(~i~0 < 100000); {5955#false} is VALID [2018-11-23 12:09:02,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {5955#false} ~i~0 := 1; {5955#false} is VALID [2018-11-23 12:09:02,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5955#false} is VALID [2018-11-23 12:09:02,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5955#false} is VALID [2018-11-23 12:09:02,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5955#false} is VALID [2018-11-23 12:09:02,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5955#false} is VALID [2018-11-23 12:09:02,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5955#false} is VALID [2018-11-23 12:09:02,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5955#false} is VALID [2018-11-23 12:09:02,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {5955#false} assume !(~i~0 < 100000); {5955#false} is VALID [2018-11-23 12:09:02,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {5955#false} ~i~0 := 1;~j~0 := 0; {5955#false} is VALID [2018-11-23 12:09:02,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {5955#false} is VALID [2018-11-23 12:09:02,472 INFO L256 TraceCheckUtils]: 41: Hoare triple {5955#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5955#false} is VALID [2018-11-23 12:09:02,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {5955#false} ~cond := #in~cond; {5955#false} is VALID [2018-11-23 12:09:02,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {5955#false} assume 0 == ~cond; {5955#false} is VALID [2018-11-23 12:09:02,473 INFO L273 TraceCheckUtils]: 44: Hoare triple {5955#false} assume !false; {5955#false} is VALID [2018-11-23 12:09:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 12:09:02,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:02,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:04,201 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 12:09:04,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:04,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:04,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {5954#true} call ULTIMATE.init(); {5954#true} is VALID [2018-11-23 12:09:04,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {5954#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5954#true} is VALID [2018-11-23 12:09:04,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {5954#true} assume true; {5954#true} is VALID [2018-11-23 12:09:04,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5954#true} {5954#true} #60#return; {5954#true} is VALID [2018-11-23 12:09:04,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {5954#true} call #t~ret4 := main(); {5954#true} is VALID [2018-11-23 12:09:04,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {5954#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {5954#true} is VALID [2018-11-23 12:09:04,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {5954#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {5954#true} assume !(~i~0 < 100000); {5954#true} is VALID [2018-11-23 12:09:04,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {5954#true} ~i~0 := 1; {5957#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:04,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {5957#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5962#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:04,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {5962#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5967#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:04,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {5967#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5972#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:04,345 INFO L273 TraceCheckUtils]: 35: Hoare triple {5972#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {5977#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:04,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {5977#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6092#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:04,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {6092#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6096#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:04,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {6096#(<= main_~i~0 31)} assume !(~i~0 < 100000); {5955#false} is VALID [2018-11-23 12:09:04,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {5955#false} ~i~0 := 1;~j~0 := 0; {5955#false} is VALID [2018-11-23 12:09:04,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {5955#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {5955#false} is VALID [2018-11-23 12:09:04,348 INFO L256 TraceCheckUtils]: 41: Hoare triple {5955#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5955#false} is VALID [2018-11-23 12:09:04,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {5955#false} ~cond := #in~cond; {5955#false} is VALID [2018-11-23 12:09:04,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {5955#false} assume 0 == ~cond; {5955#false} is VALID [2018-11-23 12:09:04,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {5955#false} assume !false; {5955#false} is VALID [2018-11-23 12:09:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-23 12:09:04,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:04,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 29 [2018-11-23 12:09:04,371 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-11-23 12:09:04,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:04,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:09:04,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:04,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:09:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:09:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:09:04,420 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 29 states. [2018-11-23 12:09:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:05,287 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2018-11-23 12:09:05,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:09:05,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-11-23 12:09:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:09:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2018-11-23 12:09:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:09:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2018-11-23 12:09:05,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 100 transitions. [2018-11-23 12:09:05,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:05,416 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:09:05,416 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:09:05,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:09:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:09:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2018-11-23 12:09:05,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:05,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 53 states. [2018-11-23 12:09:05,483 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 53 states. [2018-11-23 12:09:05,483 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 53 states. [2018-11-23 12:09:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:05,485 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:09:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:09:05,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:05,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:05,485 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 74 states. [2018-11-23 12:09:05,486 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 74 states. [2018-11-23 12:09:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:05,487 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 12:09:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:09:05,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:05,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:05,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:05,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:09:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-23 12:09:05,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 45 [2018-11-23 12:09:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:05,490 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-23 12:09:05,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:09:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 12:09:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:09:05,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:05,491 INFO L402 BasicCegarLoop]: trace histogram [27, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:05,491 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:05,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash 69268517, now seen corresponding path program 18 times [2018-11-23 12:09:05,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:05,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:05,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:05,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:06,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {6520#true} call ULTIMATE.init(); {6520#true} is VALID [2018-11-23 12:09:06,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {6520#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6520#true} is VALID [2018-11-23 12:09:06,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {6520#true} assume true; {6520#true} is VALID [2018-11-23 12:09:06,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6520#true} {6520#true} #60#return; {6520#true} is VALID [2018-11-23 12:09:06,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {6520#true} call #t~ret4 := main(); {6520#true} is VALID [2018-11-23 12:09:06,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {6520#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6522#(= main_~i~0 0)} is VALID [2018-11-23 12:09:06,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {6522#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6523#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:07,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {6523#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6524#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:07,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {6524#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6525#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:07,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {6525#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6526#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:07,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {6526#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6527#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:07,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {6527#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6528#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:07,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {6528#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6529#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:07,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {6529#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6530#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:07,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {6530#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6531#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:07,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {6531#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6532#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:07,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {6532#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6533#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:07,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {6533#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6534#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:07,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {6534#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6535#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:07,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {6535#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6536#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:07,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {6536#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6537#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:07,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {6537#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6538#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:07,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {6538#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6539#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:07,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {6539#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6540#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:07,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {6540#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6541#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:07,024 INFO L273 TraceCheckUtils]: 25: Hoare triple {6541#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6542#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:07,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {6542#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6543#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:07,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {6543#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6544#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:07,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {6544#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6545#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:07,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {6545#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6546#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:07,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {6546#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6547#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:07,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {6547#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6548#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:07,037 INFO L273 TraceCheckUtils]: 32: Hoare triple {6548#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6549#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:07,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {6549#(<= main_~i~0 27)} assume !(~i~0 < 100000); {6521#false} is VALID [2018-11-23 12:09:07,038 INFO L273 TraceCheckUtils]: 34: Hoare triple {6521#false} ~i~0 := 1; {6521#false} is VALID [2018-11-23 12:09:07,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,038 INFO L273 TraceCheckUtils]: 37: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,039 INFO L273 TraceCheckUtils]: 39: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,039 INFO L273 TraceCheckUtils]: 40: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,039 INFO L273 TraceCheckUtils]: 41: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6521#false} is VALID [2018-11-23 12:09:07,039 INFO L273 TraceCheckUtils]: 42: Hoare triple {6521#false} assume !(~i~0 < 100000); {6521#false} is VALID [2018-11-23 12:09:07,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {6521#false} ~i~0 := 1;~j~0 := 0; {6521#false} is VALID [2018-11-23 12:09:07,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {6521#false} is VALID [2018-11-23 12:09:07,040 INFO L256 TraceCheckUtils]: 45: Hoare triple {6521#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6521#false} is VALID [2018-11-23 12:09:07,040 INFO L273 TraceCheckUtils]: 46: Hoare triple {6521#false} ~cond := #in~cond; {6521#false} is VALID [2018-11-23 12:09:07,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {6521#false} assume 0 == ~cond; {6521#false} is VALID [2018-11-23 12:09:07,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {6521#false} assume !false; {6521#false} is VALID [2018-11-23 12:09:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:09:07,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:07,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:07,054 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:09:08,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:09:08,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:08,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:09,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {6520#true} call ULTIMATE.init(); {6520#true} is VALID [2018-11-23 12:09:09,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {6520#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6520#true} is VALID [2018-11-23 12:09:09,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {6520#true} assume true; {6520#true} is VALID [2018-11-23 12:09:09,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6520#true} {6520#true} #60#return; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {6520#true} call #t~ret4 := main(); {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {6520#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,388 INFO L273 TraceCheckUtils]: 31: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,388 INFO L273 TraceCheckUtils]: 32: Hoare triple {6520#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {6520#true} is VALID [2018-11-23 12:09:09,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {6520#true} assume !(~i~0 < 100000); {6520#true} is VALID [2018-11-23 12:09:09,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {6520#true} ~i~0 := 1; {6523#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:09,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {6523#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6528#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:09,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {6528#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6533#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:09,432 INFO L273 TraceCheckUtils]: 37: Hoare triple {6533#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6538#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:09,433 INFO L273 TraceCheckUtils]: 38: Hoare triple {6538#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6543#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:09,434 INFO L273 TraceCheckUtils]: 39: Hoare triple {6543#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6548#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:09,434 INFO L273 TraceCheckUtils]: 40: Hoare triple {6548#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6673#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:09,436 INFO L273 TraceCheckUtils]: 41: Hoare triple {6673#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {6677#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:09,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {6677#(<= main_~i~0 36)} assume !(~i~0 < 100000); {6521#false} is VALID [2018-11-23 12:09:09,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {6521#false} ~i~0 := 1;~j~0 := 0; {6521#false} is VALID [2018-11-23 12:09:09,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {6521#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {6521#false} is VALID [2018-11-23 12:09:09,437 INFO L256 TraceCheckUtils]: 45: Hoare triple {6521#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6521#false} is VALID [2018-11-23 12:09:09,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {6521#false} ~cond := #in~cond; {6521#false} is VALID [2018-11-23 12:09:09,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {6521#false} assume 0 == ~cond; {6521#false} is VALID [2018-11-23 12:09:09,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {6521#false} assume !false; {6521#false} is VALID [2018-11-23 12:09:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 12:09:09,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 32 [2018-11-23 12:09:09,460 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 49 [2018-11-23 12:09:09,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:09,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:09:09,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:09,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:09:09,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:09:09,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:09:09,511 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 32 states. [2018-11-23 12:09:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:10,551 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-11-23 12:09:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:09:10,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 49 [2018-11-23 12:09:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:09:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 108 transitions. [2018-11-23 12:09:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:09:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 108 transitions. [2018-11-23 12:09:10,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 108 transitions. [2018-11-23 12:09:10,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:10,742 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:09:10,742 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:09:10,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:09:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:09:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2018-11-23 12:09:10,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:10,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 57 states. [2018-11-23 12:09:10,869 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 57 states. [2018-11-23 12:09:10,870 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 57 states. [2018-11-23 12:09:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:10,872 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 12:09:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-23 12:09:10,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:10,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:10,873 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 81 states. [2018-11-23 12:09:10,873 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 81 states. [2018-11-23 12:09:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:10,875 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 12:09:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-23 12:09:10,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:10,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:10,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:10,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:09:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-23 12:09:10,877 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 49 [2018-11-23 12:09:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:10,877 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 12:09:10,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:09:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 12:09:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:09:10,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:10,878 INFO L402 BasicCegarLoop]: trace histogram [30, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:10,878 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:10,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1413295962, now seen corresponding path program 19 times [2018-11-23 12:09:10,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:10,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:10,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:12,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2018-11-23 12:09:12,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7138#true} is VALID [2018-11-23 12:09:12,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {7138#true} assume true; {7138#true} is VALID [2018-11-23 12:09:12,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7138#true} {7138#true} #60#return; {7138#true} is VALID [2018-11-23 12:09:12,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {7138#true} call #t~ret4 := main(); {7138#true} is VALID [2018-11-23 12:09:12,152 INFO L273 TraceCheckUtils]: 5: Hoare triple {7138#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7140#(= main_~i~0 0)} is VALID [2018-11-23 12:09:12,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {7140#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7141#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:12,153 INFO L273 TraceCheckUtils]: 7: Hoare triple {7141#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7142#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:12,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {7142#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7143#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:12,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {7143#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7144#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:12,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {7144#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7145#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:12,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {7145#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7146#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:12,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {7146#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7147#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:12,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {7147#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7148#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:12,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {7148#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7149#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:12,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {7149#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7150#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:12,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {7150#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7151#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:12,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {7151#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7152#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:12,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {7152#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7153#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:12,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {7153#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7154#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:12,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {7154#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7155#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:12,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {7155#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7156#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:12,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {7156#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7157#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:12,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {7157#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7158#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:12,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {7158#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7159#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:12,176 INFO L273 TraceCheckUtils]: 25: Hoare triple {7159#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7160#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:12,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {7160#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7161#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:12,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {7161#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7162#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:12,179 INFO L273 TraceCheckUtils]: 28: Hoare triple {7162#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7163#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:12,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {7163#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7164#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:12,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {7164#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7165#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:12,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {7165#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7166#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:12,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {7166#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7167#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:12,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {7167#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7168#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:12,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {7168#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7169#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:12,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {7169#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7170#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:12,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {7170#(<= main_~i~0 30)} assume !(~i~0 < 100000); {7139#false} is VALID [2018-11-23 12:09:12,189 INFO L273 TraceCheckUtils]: 37: Hoare triple {7139#false} ~i~0 := 1; {7139#false} is VALID [2018-11-23 12:09:12,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,189 INFO L273 TraceCheckUtils]: 40: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 42: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 44: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 45: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {7139#false} assume !(~i~0 < 100000); {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {7139#false} ~i~0 := 1;~j~0 := 0; {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {7139#false} is VALID [2018-11-23 12:09:12,190 INFO L256 TraceCheckUtils]: 49: Hoare triple {7139#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7139#false} is VALID [2018-11-23 12:09:12,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2018-11-23 12:09:12,191 INFO L273 TraceCheckUtils]: 51: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2018-11-23 12:09:12,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2018-11-23 12:09:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:12,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:12,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:12,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:12,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:12,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2018-11-23 12:09:12,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7138#true} is VALID [2018-11-23 12:09:12,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {7138#true} assume true; {7138#true} is VALID [2018-11-23 12:09:12,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7138#true} {7138#true} #60#return; {7138#true} is VALID [2018-11-23 12:09:12,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {7138#true} call #t~ret4 := main(); {7138#true} is VALID [2018-11-23 12:09:12,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {7138#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7189#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:12,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {7189#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7141#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:12,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {7141#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7142#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:12,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {7142#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7143#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:12,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {7143#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7144#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:12,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {7144#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7145#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:12,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {7145#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7146#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:12,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {7146#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7147#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:12,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {7147#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7148#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:12,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {7148#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7149#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:12,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {7149#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7150#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:12,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {7150#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7151#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:12,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {7151#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7152#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:12,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {7152#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7153#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:12,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {7153#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7154#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:12,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {7154#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7155#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:12,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {7155#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7156#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:12,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {7156#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7157#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:12,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {7157#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7158#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:12,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {7158#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7159#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:12,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {7159#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7160#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:12,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {7160#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7161#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:12,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {7161#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7162#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:12,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {7162#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7163#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:12,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {7163#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7164#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:12,559 INFO L273 TraceCheckUtils]: 30: Hoare triple {7164#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7165#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:12,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {7165#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7166#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:12,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {7166#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7167#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:12,562 INFO L273 TraceCheckUtils]: 33: Hoare triple {7167#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7168#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:12,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {7168#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7169#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:12,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {7169#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7170#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:12,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {7170#(<= main_~i~0 30)} assume !(~i~0 < 100000); {7139#false} is VALID [2018-11-23 12:09:12,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {7139#false} ~i~0 := 1; {7139#false} is VALID [2018-11-23 12:09:12,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,565 INFO L273 TraceCheckUtils]: 39: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,566 INFO L273 TraceCheckUtils]: 40: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,566 INFO L273 TraceCheckUtils]: 43: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,566 INFO L273 TraceCheckUtils]: 44: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7139#false} is VALID [2018-11-23 12:09:12,567 INFO L273 TraceCheckUtils]: 46: Hoare triple {7139#false} assume !(~i~0 < 100000); {7139#false} is VALID [2018-11-23 12:09:12,567 INFO L273 TraceCheckUtils]: 47: Hoare triple {7139#false} ~i~0 := 1;~j~0 := 0; {7139#false} is VALID [2018-11-23 12:09:12,567 INFO L273 TraceCheckUtils]: 48: Hoare triple {7139#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {7139#false} is VALID [2018-11-23 12:09:12,567 INFO L256 TraceCheckUtils]: 49: Hoare triple {7139#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7139#false} is VALID [2018-11-23 12:09:12,568 INFO L273 TraceCheckUtils]: 50: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2018-11-23 12:09:12,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2018-11-23 12:09:12,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2018-11-23 12:09:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:12,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:12,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:09:12,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-11-23 12:09:12,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:12,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:09:12,627 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 12:09:12,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:09:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:09:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:09:12,628 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 34 states. [2018-11-23 12:09:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:13,414 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-11-23 12:09:13,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:09:13,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-11-23 12:09:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:09:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 96 transitions. [2018-11-23 12:09:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:09:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 96 transitions. [2018-11-23 12:09:13,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 96 transitions. [2018-11-23 12:09:13,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:13,523 INFO L225 Difference]: With dead ends: 96 [2018-11-23 12:09:13,524 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:09:13,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:09:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:09:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-11-23 12:09:13,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:13,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 58 states. [2018-11-23 12:09:13,682 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 58 states. [2018-11-23 12:09:13,682 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 58 states. [2018-11-23 12:09:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:13,684 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:09:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-23 12:09:13,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:13,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:13,684 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 76 states. [2018-11-23 12:09:13,684 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 76 states. [2018-11-23 12:09:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:13,686 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:09:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-11-23 12:09:13,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:13,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:13,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:13,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:09:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 12:09:13,688 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 53 [2018-11-23 12:09:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:13,688 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 12:09:13,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:09:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 12:09:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:09:13,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:13,689 INFO L402 BasicCegarLoop]: trace histogram [31, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:13,689 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:13,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash 90376650, now seen corresponding path program 20 times [2018-11-23 12:09:13,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:13,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:13,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:14,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {7756#true} call ULTIMATE.init(); {7756#true} is VALID [2018-11-23 12:09:14,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {7756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7756#true} is VALID [2018-11-23 12:09:14,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {7756#true} assume true; {7756#true} is VALID [2018-11-23 12:09:14,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7756#true} {7756#true} #60#return; {7756#true} is VALID [2018-11-23 12:09:14,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {7756#true} call #t~ret4 := main(); {7756#true} is VALID [2018-11-23 12:09:14,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {7756#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7758#(= main_~i~0 0)} is VALID [2018-11-23 12:09:14,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {7758#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7759#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:14,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {7759#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7760#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:14,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {7760#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7761#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:14,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {7761#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7762#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:14,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {7762#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7763#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:14,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {7763#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7764#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:14,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {7764#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7765#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:14,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {7765#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7766#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:14,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {7766#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7767#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:14,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {7767#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7768#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:14,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {7768#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7769#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:14,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {7769#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7770#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:14,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {7770#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7771#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:14,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {7771#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7772#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:14,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {7772#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7773#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:14,322 INFO L273 TraceCheckUtils]: 21: Hoare triple {7773#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7774#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:14,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {7774#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7775#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:14,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {7775#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7776#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:14,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {7776#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7777#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:14,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {7777#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7778#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:14,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {7778#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7779#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:14,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {7779#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7780#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:14,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {7780#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7781#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:14,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {7781#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7782#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:14,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {7782#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7783#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:14,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {7783#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7784#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:14,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {7784#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7785#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:14,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {7785#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7786#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:14,335 INFO L273 TraceCheckUtils]: 34: Hoare triple {7786#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7787#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:14,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {7787#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7788#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:14,337 INFO L273 TraceCheckUtils]: 36: Hoare triple {7788#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7789#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:14,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {7789#(<= main_~i~0 31)} assume !(~i~0 < 100000); {7757#false} is VALID [2018-11-23 12:09:14,338 INFO L273 TraceCheckUtils]: 38: Hoare triple {7757#false} ~i~0 := 1; {7757#false} is VALID [2018-11-23 12:09:14,338 INFO L273 TraceCheckUtils]: 39: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,338 INFO L273 TraceCheckUtils]: 40: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,338 INFO L273 TraceCheckUtils]: 41: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,339 INFO L273 TraceCheckUtils]: 43: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,339 INFO L273 TraceCheckUtils]: 44: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,339 INFO L273 TraceCheckUtils]: 45: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {7757#false} assume !(~i~0 < 100000); {7757#false} is VALID [2018-11-23 12:09:14,340 INFO L273 TraceCheckUtils]: 48: Hoare triple {7757#false} ~i~0 := 1;~j~0 := 0; {7757#false} is VALID [2018-11-23 12:09:14,340 INFO L273 TraceCheckUtils]: 49: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {7757#false} is VALID [2018-11-23 12:09:14,340 INFO L256 TraceCheckUtils]: 50: Hoare triple {7757#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7757#false} is VALID [2018-11-23 12:09:14,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {7757#false} ~cond := #in~cond; {7757#false} is VALID [2018-11-23 12:09:14,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {7757#false} assume 0 == ~cond; {7757#false} is VALID [2018-11-23 12:09:14,341 INFO L273 TraceCheckUtils]: 53: Hoare triple {7757#false} assume !false; {7757#false} is VALID [2018-11-23 12:09:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:14,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:14,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:14,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:14,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:14,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:14,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:14,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {7756#true} call ULTIMATE.init(); {7756#true} is VALID [2018-11-23 12:09:14,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {7756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7756#true} is VALID [2018-11-23 12:09:14,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {7756#true} assume true; {7756#true} is VALID [2018-11-23 12:09:14,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7756#true} {7756#true} #60#return; {7756#true} is VALID [2018-11-23 12:09:14,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {7756#true} call #t~ret4 := main(); {7756#true} is VALID [2018-11-23 12:09:14,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {7756#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {7808#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:14,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {7808#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7759#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:14,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {7759#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7760#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:14,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {7760#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7761#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:14,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {7761#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7762#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:14,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {7762#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7763#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:14,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {7763#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7764#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:14,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {7764#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7765#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:14,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {7765#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7766#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:14,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {7766#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7767#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:14,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {7767#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7768#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:14,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {7768#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7769#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:14,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {7769#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7770#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:14,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {7770#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7771#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:14,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {7771#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7772#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:14,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {7772#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7773#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:14,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {7773#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7774#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:14,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {7774#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7775#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:14,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {7775#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7776#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:14,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {7776#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7777#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:14,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {7777#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7778#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:14,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {7778#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7779#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:14,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {7779#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7780#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:14,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {7780#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7781#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:14,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {7781#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7782#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:14,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {7782#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7783#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:14,703 INFO L273 TraceCheckUtils]: 31: Hoare triple {7783#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7784#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:14,704 INFO L273 TraceCheckUtils]: 32: Hoare triple {7784#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7785#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:14,705 INFO L273 TraceCheckUtils]: 33: Hoare triple {7785#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7786#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:14,706 INFO L273 TraceCheckUtils]: 34: Hoare triple {7786#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7787#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:14,706 INFO L273 TraceCheckUtils]: 35: Hoare triple {7787#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7788#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:14,707 INFO L273 TraceCheckUtils]: 36: Hoare triple {7788#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {7789#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:14,708 INFO L273 TraceCheckUtils]: 37: Hoare triple {7789#(<= main_~i~0 31)} assume !(~i~0 < 100000); {7757#false} is VALID [2018-11-23 12:09:14,708 INFO L273 TraceCheckUtils]: 38: Hoare triple {7757#false} ~i~0 := 1; {7757#false} is VALID [2018-11-23 12:09:14,708 INFO L273 TraceCheckUtils]: 39: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,709 INFO L273 TraceCheckUtils]: 40: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,709 INFO L273 TraceCheckUtils]: 41: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,709 INFO L273 TraceCheckUtils]: 42: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,709 INFO L273 TraceCheckUtils]: 43: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,710 INFO L273 TraceCheckUtils]: 45: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,710 INFO L273 TraceCheckUtils]: 46: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {7757#false} is VALID [2018-11-23 12:09:14,710 INFO L273 TraceCheckUtils]: 47: Hoare triple {7757#false} assume !(~i~0 < 100000); {7757#false} is VALID [2018-11-23 12:09:14,710 INFO L273 TraceCheckUtils]: 48: Hoare triple {7757#false} ~i~0 := 1;~j~0 := 0; {7757#false} is VALID [2018-11-23 12:09:14,710 INFO L273 TraceCheckUtils]: 49: Hoare triple {7757#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {7757#false} is VALID [2018-11-23 12:09:14,711 INFO L256 TraceCheckUtils]: 50: Hoare triple {7757#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7757#false} is VALID [2018-11-23 12:09:14,711 INFO L273 TraceCheckUtils]: 51: Hoare triple {7757#false} ~cond := #in~cond; {7757#false} is VALID [2018-11-23 12:09:14,711 INFO L273 TraceCheckUtils]: 52: Hoare triple {7757#false} assume 0 == ~cond; {7757#false} is VALID [2018-11-23 12:09:14,711 INFO L273 TraceCheckUtils]: 53: Hoare triple {7757#false} assume !false; {7757#false} is VALID [2018-11-23 12:09:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:14,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:09:14,732 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 54 [2018-11-23 12:09:14,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:14,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:09:14,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:14,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:09:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:09:14,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:09:14,771 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 35 states. [2018-11-23 12:09:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:16,805 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-23 12:09:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:09:16,805 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 54 [2018-11-23 12:09:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:09:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 102 transitions. [2018-11-23 12:09:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:09:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 102 transitions. [2018-11-23 12:09:16,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 102 transitions. [2018-11-23 12:09:16,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:16,916 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:09:16,916 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:09:16,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:09:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:09:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-11-23 12:09:16,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:16,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 59 states. [2018-11-23 12:09:16,966 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 59 states. [2018-11-23 12:09:16,966 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 59 states. [2018-11-23 12:09:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:16,969 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-11-23 12:09:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-23 12:09:16,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:16,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:16,970 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 80 states. [2018-11-23 12:09:16,970 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 80 states. [2018-11-23 12:09:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:16,971 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-11-23 12:09:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-23 12:09:16,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:16,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:16,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:16,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:09:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-23 12:09:16,974 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 54 [2018-11-23 12:09:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:16,974 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-23 12:09:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:09:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 12:09:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:09:16,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:16,976 INFO L402 BasicCegarLoop]: trace histogram [32, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:16,976 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:16,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -540412634, now seen corresponding path program 21 times [2018-11-23 12:09:16,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:16,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:18,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {8395#true} call ULTIMATE.init(); {8395#true} is VALID [2018-11-23 12:09:18,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {8395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8395#true} is VALID [2018-11-23 12:09:18,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {8395#true} assume true; {8395#true} is VALID [2018-11-23 12:09:18,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8395#true} {8395#true} #60#return; {8395#true} is VALID [2018-11-23 12:09:18,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {8395#true} call #t~ret4 := main(); {8395#true} is VALID [2018-11-23 12:09:18,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {8395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8397#(= main_~i~0 0)} is VALID [2018-11-23 12:09:18,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {8397#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8398#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:18,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {8398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8399#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:18,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {8399#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8400#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:18,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {8400#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8401#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:18,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {8401#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8402#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:18,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {8402#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8403#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:18,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {8403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8404#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:18,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {8404#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8405#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:18,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {8405#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8406#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:18,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {8406#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8407#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:18,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {8407#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8408#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:18,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {8408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8409#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:18,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {8409#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8410#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:18,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {8410#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8411#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:18,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {8411#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8412#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:18,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {8412#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8413#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:18,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {8413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8414#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:18,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {8414#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8415#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:18,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {8415#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8416#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:18,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {8416#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8417#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:18,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {8417#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8418#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:18,038 INFO L273 TraceCheckUtils]: 27: Hoare triple {8418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8419#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:18,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {8419#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8420#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:18,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {8420#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8421#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:18,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {8421#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8422#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:18,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {8422#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8423#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:18,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {8423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8424#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:18,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {8424#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8425#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:18,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {8425#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8426#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:18,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {8426#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8427#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:18,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {8427#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8428#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:18,048 INFO L273 TraceCheckUtils]: 37: Hoare triple {8428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8429#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:18,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {8429#(<= main_~i~0 32)} assume !(~i~0 < 100000); {8396#false} is VALID [2018-11-23 12:09:18,049 INFO L273 TraceCheckUtils]: 39: Hoare triple {8396#false} ~i~0 := 1; {8396#false} is VALID [2018-11-23 12:09:18,049 INFO L273 TraceCheckUtils]: 40: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,049 INFO L273 TraceCheckUtils]: 41: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,050 INFO L273 TraceCheckUtils]: 43: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,050 INFO L273 TraceCheckUtils]: 44: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,050 INFO L273 TraceCheckUtils]: 45: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,050 INFO L273 TraceCheckUtils]: 46: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,050 INFO L273 TraceCheckUtils]: 47: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8396#false} is VALID [2018-11-23 12:09:18,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {8396#false} assume !(~i~0 < 100000); {8396#false} is VALID [2018-11-23 12:09:18,051 INFO L273 TraceCheckUtils]: 49: Hoare triple {8396#false} ~i~0 := 1;~j~0 := 0; {8396#false} is VALID [2018-11-23 12:09:18,051 INFO L273 TraceCheckUtils]: 50: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {8396#false} is VALID [2018-11-23 12:09:18,051 INFO L256 TraceCheckUtils]: 51: Hoare triple {8396#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8396#false} is VALID [2018-11-23 12:09:18,051 INFO L273 TraceCheckUtils]: 52: Hoare triple {8396#false} ~cond := #in~cond; {8396#false} is VALID [2018-11-23 12:09:18,051 INFO L273 TraceCheckUtils]: 53: Hoare triple {8396#false} assume 0 == ~cond; {8396#false} is VALID [2018-11-23 12:09:18,052 INFO L273 TraceCheckUtils]: 54: Hoare triple {8396#false} assume !false; {8396#false} is VALID [2018-11-23 12:09:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:09:18,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:18,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:18,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:18,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:09:18,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:18,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:18,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {8395#true} call ULTIMATE.init(); {8395#true} is VALID [2018-11-23 12:09:18,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {8395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8395#true} is VALID [2018-11-23 12:09:18,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {8395#true} assume true; {8395#true} is VALID [2018-11-23 12:09:18,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8395#true} {8395#true} #60#return; {8395#true} is VALID [2018-11-23 12:09:18,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {8395#true} call #t~ret4 := main(); {8395#true} is VALID [2018-11-23 12:09:18,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {8395#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {8395#true} is VALID [2018-11-23 12:09:18,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {8395#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {8395#true} is VALID [2018-11-23 12:09:18,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {8395#true} assume !(~i~0 < 100000); {8395#true} is VALID [2018-11-23 12:09:18,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {8395#true} ~i~0 := 1; {8398#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:18,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {8398#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8403#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:18,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {8403#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8408#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:18,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {8408#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8413#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:18,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {8413#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8418#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:18,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {8418#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8423#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:18,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {8423#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8428#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:18,414 INFO L273 TraceCheckUtils]: 46: Hoare triple {8428#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8571#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:18,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {8571#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {8575#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:18,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {8575#(<= main_~i~0 41)} assume !(~i~0 < 100000); {8396#false} is VALID [2018-11-23 12:09:18,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {8396#false} ~i~0 := 1;~j~0 := 0; {8396#false} is VALID [2018-11-23 12:09:18,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {8396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {8396#false} is VALID [2018-11-23 12:09:18,416 INFO L256 TraceCheckUtils]: 51: Hoare triple {8396#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8396#false} is VALID [2018-11-23 12:09:18,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {8396#false} ~cond := #in~cond; {8396#false} is VALID [2018-11-23 12:09:18,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {8396#false} assume 0 == ~cond; {8396#false} is VALID [2018-11-23 12:09:18,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {8396#false} assume !false; {8396#false} is VALID [2018-11-23 12:09:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-23 12:09:18,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:18,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 11] total 37 [2018-11-23 12:09:18,440 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-11-23 12:09:18,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:18,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:09:18,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:18,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:09:18,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:09:18,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:09:18,502 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 37 states. [2018-11-23 12:09:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:20,100 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2018-11-23 12:09:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:09:20,100 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-11-23 12:09:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:09:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 118 transitions. [2018-11-23 12:09:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:09:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 118 transitions. [2018-11-23 12:09:20,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 118 transitions. [2018-11-23 12:09:20,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:20,231 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:09:20,232 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:09:20,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:09:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:09:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-11-23 12:09:20,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:20,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 63 states. [2018-11-23 12:09:20,283 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 63 states. [2018-11-23 12:09:20,283 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 63 states. [2018-11-23 12:09:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:20,285 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-23 12:09:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-23 12:09:20,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:20,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:20,286 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 90 states. [2018-11-23 12:09:20,286 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 90 states. [2018-11-23 12:09:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:20,288 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-11-23 12:09:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-23 12:09:20,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:20,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:20,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:20,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:09:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 12:09:20,290 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 55 [2018-11-23 12:09:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:20,290 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 12:09:20,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:09:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 12:09:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 12:09:20,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:20,291 INFO L402 BasicCegarLoop]: trace histogram [35, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:20,292 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:20,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1383275205, now seen corresponding path program 22 times [2018-11-23 12:09:20,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:20,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:20,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:20,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:20,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:21,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {9085#true} call ULTIMATE.init(); {9085#true} is VALID [2018-11-23 12:09:21,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {9085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9085#true} is VALID [2018-11-23 12:09:21,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {9085#true} assume true; {9085#true} is VALID [2018-11-23 12:09:21,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9085#true} {9085#true} #60#return; {9085#true} is VALID [2018-11-23 12:09:21,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {9085#true} call #t~ret4 := main(); {9085#true} is VALID [2018-11-23 12:09:21,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {9085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9087#(= main_~i~0 0)} is VALID [2018-11-23 12:09:21,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {9087#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9088#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:21,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {9088#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9089#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:21,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {9089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9090#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:21,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {9090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9091#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:21,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {9091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9092#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:21,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {9092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9093#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:21,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {9093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9094#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:21,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {9094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9095#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:21,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {9095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9096#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:21,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {9096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9097#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:21,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {9097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9098#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:21,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {9098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9099#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:21,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {9099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9100#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:21,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {9100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9101#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:21,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {9101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9102#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:21,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {9102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9103#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:21,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {9103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9104#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:21,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {9104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9105#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:21,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {9105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9106#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:21,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {9106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9107#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:21,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {9107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9108#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:21,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {9108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9109#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:21,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {9109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9110#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:21,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {9110#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9111#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:21,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {9111#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9112#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:21,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {9112#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9113#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:21,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {9113#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9114#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:21,158 INFO L273 TraceCheckUtils]: 33: Hoare triple {9114#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9115#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:21,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {9115#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9116#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:21,160 INFO L273 TraceCheckUtils]: 35: Hoare triple {9116#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9117#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:21,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {9117#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9118#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:21,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {9118#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9119#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:21,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {9119#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9120#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:21,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {9120#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9121#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:21,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {9121#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9122#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:21,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {9122#(<= main_~i~0 35)} assume !(~i~0 < 100000); {9086#false} is VALID [2018-11-23 12:09:21,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {9086#false} ~i~0 := 1; {9086#false} is VALID [2018-11-23 12:09:21,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,165 INFO L273 TraceCheckUtils]: 44: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,166 INFO L273 TraceCheckUtils]: 45: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,166 INFO L273 TraceCheckUtils]: 46: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,166 INFO L273 TraceCheckUtils]: 47: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,166 INFO L273 TraceCheckUtils]: 48: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,166 INFO L273 TraceCheckUtils]: 49: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,167 INFO L273 TraceCheckUtils]: 50: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,167 INFO L273 TraceCheckUtils]: 51: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,167 INFO L273 TraceCheckUtils]: 52: Hoare triple {9086#false} assume !(~i~0 < 100000); {9086#false} is VALID [2018-11-23 12:09:21,167 INFO L273 TraceCheckUtils]: 53: Hoare triple {9086#false} ~i~0 := 1;~j~0 := 0; {9086#false} is VALID [2018-11-23 12:09:21,167 INFO L273 TraceCheckUtils]: 54: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {9086#false} is VALID [2018-11-23 12:09:21,167 INFO L256 TraceCheckUtils]: 55: Hoare triple {9086#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9086#false} is VALID [2018-11-23 12:09:21,168 INFO L273 TraceCheckUtils]: 56: Hoare triple {9086#false} ~cond := #in~cond; {9086#false} is VALID [2018-11-23 12:09:21,168 INFO L273 TraceCheckUtils]: 57: Hoare triple {9086#false} assume 0 == ~cond; {9086#false} is VALID [2018-11-23 12:09:21,168 INFO L273 TraceCheckUtils]: 58: Hoare triple {9086#false} assume !false; {9086#false} is VALID [2018-11-23 12:09:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:21,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:21,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:21,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:09:21,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:09:21,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:21,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:21,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {9085#true} call ULTIMATE.init(); {9085#true} is VALID [2018-11-23 12:09:21,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {9085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9085#true} is VALID [2018-11-23 12:09:21,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {9085#true} assume true; {9085#true} is VALID [2018-11-23 12:09:21,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9085#true} {9085#true} #60#return; {9085#true} is VALID [2018-11-23 12:09:21,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {9085#true} call #t~ret4 := main(); {9085#true} is VALID [2018-11-23 12:09:21,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {9085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9141#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:21,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {9141#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9088#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:21,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {9088#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9089#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:21,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {9089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9090#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:21,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {9090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9091#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:21,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {9091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9092#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:21,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {9092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9093#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:21,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {9093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9094#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:21,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {9094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9095#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:21,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {9095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9096#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:21,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {9096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9097#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:21,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {9097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9098#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:21,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {9098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9099#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:21,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {9099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9100#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:21,522 INFO L273 TraceCheckUtils]: 19: Hoare triple {9100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9101#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:21,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {9101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9102#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:21,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {9102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9103#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:21,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {9103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9104#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:21,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {9104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9105#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:21,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {9105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9106#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:21,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {9106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9107#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:21,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {9107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9108#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:21,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {9108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9109#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:21,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {9109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9110#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:21,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {9110#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9111#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:21,534 INFO L273 TraceCheckUtils]: 30: Hoare triple {9111#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9112#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:21,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {9112#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9113#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:21,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {9113#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9114#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:21,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {9114#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9115#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:21,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {9115#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9116#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:21,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {9116#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9117#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:21,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {9117#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9118#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:21,541 INFO L273 TraceCheckUtils]: 37: Hoare triple {9118#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9119#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:21,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {9119#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9120#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:21,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {9120#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9121#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:21,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {9121#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9122#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:21,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {9122#(<= main_~i~0 35)} assume !(~i~0 < 100000); {9086#false} is VALID [2018-11-23 12:09:21,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {9086#false} ~i~0 := 1; {9086#false} is VALID [2018-11-23 12:09:21,545 INFO L273 TraceCheckUtils]: 43: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,546 INFO L273 TraceCheckUtils]: 45: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,546 INFO L273 TraceCheckUtils]: 46: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,546 INFO L273 TraceCheckUtils]: 47: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,546 INFO L273 TraceCheckUtils]: 48: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,547 INFO L273 TraceCheckUtils]: 49: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,547 INFO L273 TraceCheckUtils]: 50: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9086#false} is VALID [2018-11-23 12:09:21,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {9086#false} assume !(~i~0 < 100000); {9086#false} is VALID [2018-11-23 12:09:21,547 INFO L273 TraceCheckUtils]: 53: Hoare triple {9086#false} ~i~0 := 1;~j~0 := 0; {9086#false} is VALID [2018-11-23 12:09:21,548 INFO L273 TraceCheckUtils]: 54: Hoare triple {9086#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {9086#false} is VALID [2018-11-23 12:09:21,548 INFO L256 TraceCheckUtils]: 55: Hoare triple {9086#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9086#false} is VALID [2018-11-23 12:09:21,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {9086#false} ~cond := #in~cond; {9086#false} is VALID [2018-11-23 12:09:21,548 INFO L273 TraceCheckUtils]: 57: Hoare triple {9086#false} assume 0 == ~cond; {9086#false} is VALID [2018-11-23 12:09:21,548 INFO L273 TraceCheckUtils]: 58: Hoare triple {9086#false} assume !false; {9086#false} is VALID [2018-11-23 12:09:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:21,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:21,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:09:21,571 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2018-11-23 12:09:21,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:21,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:09:21,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:21,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:09:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:09:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:09:21,616 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 39 states. [2018-11-23 12:09:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:25,916 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2018-11-23 12:09:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:09:25,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 59 [2018-11-23 12:09:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:09:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 106 transitions. [2018-11-23 12:09:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:09:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 106 transitions. [2018-11-23 12:09:25,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 106 transitions. [2018-11-23 12:09:26,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:26,022 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:09:26,023 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 12:09:26,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:09:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 12:09:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2018-11-23 12:09:26,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:26,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 64 states. [2018-11-23 12:09:26,089 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 64 states. [2018-11-23 12:09:26,089 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 64 states. [2018-11-23 12:09:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:26,091 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-23 12:09:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-23 12:09:26,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:26,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:26,092 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 85 states. [2018-11-23 12:09:26,092 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 85 states. [2018-11-23 12:09:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:26,094 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-23 12:09:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-23 12:09:26,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:26,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:26,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:26,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:09:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 12:09:26,096 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 59 [2018-11-23 12:09:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:26,096 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 12:09:26,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:09:26,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 12:09:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:09:26,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:26,097 INFO L402 BasicCegarLoop]: trace histogram [36, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:26,097 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:26,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:26,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1482364695, now seen corresponding path program 23 times [2018-11-23 12:09:26,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:26,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:26,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:26,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:26,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:27,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {9775#true} call ULTIMATE.init(); {9775#true} is VALID [2018-11-23 12:09:27,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {9775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9775#true} is VALID [2018-11-23 12:09:27,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {9775#true} assume true; {9775#true} is VALID [2018-11-23 12:09:27,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9775#true} {9775#true} #60#return; {9775#true} is VALID [2018-11-23 12:09:27,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {9775#true} call #t~ret4 := main(); {9775#true} is VALID [2018-11-23 12:09:27,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {9775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9777#(= main_~i~0 0)} is VALID [2018-11-23 12:09:27,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {9777#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9778#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:27,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {9778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9779#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:27,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {9779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9780#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:27,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {9780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9781#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:27,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {9781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9782#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:27,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {9782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9783#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:27,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {9783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9784#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:27,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {9784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9785#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:27,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {9785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9786#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:27,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {9786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9787#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:27,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {9787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9788#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:27,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {9788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9789#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:27,150 INFO L273 TraceCheckUtils]: 18: Hoare triple {9789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9790#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:27,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {9790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9791#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:27,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {9791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9792#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:27,153 INFO L273 TraceCheckUtils]: 21: Hoare triple {9792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9793#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:27,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {9793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9794#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:27,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {9794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9795#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:27,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {9795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9796#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:27,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {9796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9797#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:27,158 INFO L273 TraceCheckUtils]: 26: Hoare triple {9797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9798#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:27,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {9798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9799#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:27,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {9799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9800#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:27,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {9800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9801#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:27,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {9801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9802#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:27,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {9802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9803#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:27,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {9803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9804#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:27,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {9804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9805#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:27,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {9805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9806#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:27,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {9806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9807#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:27,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {9807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9808#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:27,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {9808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9809#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:27,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {9809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9810#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:27,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {9810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9811#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:27,171 INFO L273 TraceCheckUtils]: 40: Hoare triple {9811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9812#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:27,183 INFO L273 TraceCheckUtils]: 41: Hoare triple {9812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9813#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:27,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {9813#(<= main_~i~0 36)} assume !(~i~0 < 100000); {9776#false} is VALID [2018-11-23 12:09:27,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {9776#false} ~i~0 := 1; {9776#false} is VALID [2018-11-23 12:09:27,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,184 INFO L273 TraceCheckUtils]: 45: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {9776#false} assume !(~i~0 < 100000); {9776#false} is VALID [2018-11-23 12:09:27,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {9776#false} ~i~0 := 1;~j~0 := 0; {9776#false} is VALID [2018-11-23 12:09:27,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {9776#false} is VALID [2018-11-23 12:09:27,186 INFO L256 TraceCheckUtils]: 56: Hoare triple {9776#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9776#false} is VALID [2018-11-23 12:09:27,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {9776#false} ~cond := #in~cond; {9776#false} is VALID [2018-11-23 12:09:27,186 INFO L273 TraceCheckUtils]: 58: Hoare triple {9776#false} assume 0 == ~cond; {9776#false} is VALID [2018-11-23 12:09:27,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {9776#false} assume !false; {9776#false} is VALID [2018-11-23 12:09:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:27,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:27,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:27,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:09:42,772 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 12:09:42,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:42,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:43,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {9775#true} call ULTIMATE.init(); {9775#true} is VALID [2018-11-23 12:09:43,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {9775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9775#true} is VALID [2018-11-23 12:09:43,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {9775#true} assume true; {9775#true} is VALID [2018-11-23 12:09:43,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9775#true} {9775#true} #60#return; {9775#true} is VALID [2018-11-23 12:09:43,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {9775#true} call #t~ret4 := main(); {9775#true} is VALID [2018-11-23 12:09:43,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {9775#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {9832#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:43,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {9832#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9778#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:43,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {9778#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9779#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:43,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {9779#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9780#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:43,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {9780#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9781#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:43,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {9781#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9782#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:43,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {9782#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9783#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:43,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {9783#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9784#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:43,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {9784#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9785#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:43,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {9785#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9786#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:43,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {9786#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9787#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:43,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {9787#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9788#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:43,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {9788#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9789#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:43,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {9789#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9790#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:43,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {9790#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9791#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:43,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {9791#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9792#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:43,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {9792#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9793#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:43,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {9793#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9794#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:43,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {9794#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9795#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:43,232 INFO L273 TraceCheckUtils]: 24: Hoare triple {9795#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9796#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:43,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {9796#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9797#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:43,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {9797#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9798#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:43,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {9798#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9799#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:43,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {9799#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9800#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:43,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {9800#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9801#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:43,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {9801#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9802#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:43,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {9802#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9803#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:43,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {9803#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9804#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:43,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {9804#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9805#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:43,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {9805#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9806#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:43,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {9806#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9807#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:43,244 INFO L273 TraceCheckUtils]: 36: Hoare triple {9807#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9808#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:43,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {9808#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9809#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:43,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {9809#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9810#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:43,247 INFO L273 TraceCheckUtils]: 39: Hoare triple {9810#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9811#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:43,248 INFO L273 TraceCheckUtils]: 40: Hoare triple {9811#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9812#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:43,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {9812#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {9813#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:43,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {9813#(<= main_~i~0 36)} assume !(~i~0 < 100000); {9776#false} is VALID [2018-11-23 12:09:43,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {9776#false} ~i~0 := 1; {9776#false} is VALID [2018-11-23 12:09:43,250 INFO L273 TraceCheckUtils]: 44: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,250 INFO L273 TraceCheckUtils]: 45: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,251 INFO L273 TraceCheckUtils]: 46: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,251 INFO L273 TraceCheckUtils]: 48: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,251 INFO L273 TraceCheckUtils]: 49: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,251 INFO L273 TraceCheckUtils]: 50: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,252 INFO L273 TraceCheckUtils]: 51: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,252 INFO L273 TraceCheckUtils]: 52: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {9776#false} is VALID [2018-11-23 12:09:43,252 INFO L273 TraceCheckUtils]: 53: Hoare triple {9776#false} assume !(~i~0 < 100000); {9776#false} is VALID [2018-11-23 12:09:43,252 INFO L273 TraceCheckUtils]: 54: Hoare triple {9776#false} ~i~0 := 1;~j~0 := 0; {9776#false} is VALID [2018-11-23 12:09:43,252 INFO L273 TraceCheckUtils]: 55: Hoare triple {9776#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {9776#false} is VALID [2018-11-23 12:09:43,253 INFO L256 TraceCheckUtils]: 56: Hoare triple {9776#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9776#false} is VALID [2018-11-23 12:09:43,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {9776#false} ~cond := #in~cond; {9776#false} is VALID [2018-11-23 12:09:43,253 INFO L273 TraceCheckUtils]: 58: Hoare triple {9776#false} assume 0 == ~cond; {9776#false} is VALID [2018-11-23 12:09:43,253 INFO L273 TraceCheckUtils]: 59: Hoare triple {9776#false} assume !false; {9776#false} is VALID [2018-11-23 12:09:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:09:43,280 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-11-23 12:09:43,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:43,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:09:43,324 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 12:09:43,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:09:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:09:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:09:43,326 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 40 states. [2018-11-23 12:09:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:44,443 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-11-23 12:09:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:09:44,443 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-11-23 12:09:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:09:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 112 transitions. [2018-11-23 12:09:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:09:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 112 transitions. [2018-11-23 12:09:44,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 112 transitions. [2018-11-23 12:09:44,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:44,551 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:09:44,551 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 12:09:44,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:09:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 12:09:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2018-11-23 12:09:44,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:44,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 65 states. [2018-11-23 12:09:44,603 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 65 states. [2018-11-23 12:09:44,604 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 65 states. [2018-11-23 12:09:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:44,606 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:09:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:09:44,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:44,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:44,607 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 89 states. [2018-11-23 12:09:44,607 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 89 states. [2018-11-23 12:09:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:44,609 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:09:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:09:44,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:44,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:44,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:44,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:09:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 12:09:44,611 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 60 [2018-11-23 12:09:44,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:44,612 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 12:09:44,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:09:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 12:09:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:09:44,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:44,613 INFO L402 BasicCegarLoop]: trace histogram [37, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:44,613 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:44,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash -122888379, now seen corresponding path program 24 times [2018-11-23 12:09:44,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:44,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:45,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {10486#true} call ULTIMATE.init(); {10486#true} is VALID [2018-11-23 12:09:45,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {10486#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10486#true} is VALID [2018-11-23 12:09:45,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {10486#true} assume true; {10486#true} is VALID [2018-11-23 12:09:45,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10486#true} {10486#true} #60#return; {10486#true} is VALID [2018-11-23 12:09:45,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {10486#true} call #t~ret4 := main(); {10486#true} is VALID [2018-11-23 12:09:45,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {10486#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10488#(= main_~i~0 0)} is VALID [2018-11-23 12:09:45,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {10488#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10489#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:45,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {10489#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10490#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:45,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {10490#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10491#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:45,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {10491#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10492#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:45,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {10492#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10493#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:45,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {10493#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10494#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:45,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {10494#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10495#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:45,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {10495#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10496#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:45,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {10496#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10497#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:45,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {10497#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10498#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:45,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {10498#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10499#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:45,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {10499#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10500#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:45,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {10500#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10501#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:45,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {10501#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10502#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:45,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {10502#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10503#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:45,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {10503#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10504#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:45,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {10504#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10505#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:45,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {10505#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10506#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:45,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {10506#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10507#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:45,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {10507#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10508#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:45,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {10508#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10509#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:45,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {10509#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10510#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:45,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {10510#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10511#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:45,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {10511#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10512#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:45,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {10512#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10513#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:45,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {10513#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10514#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:45,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {10514#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10515#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:45,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {10515#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10516#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:45,968 INFO L273 TraceCheckUtils]: 34: Hoare triple {10516#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10517#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:45,969 INFO L273 TraceCheckUtils]: 35: Hoare triple {10517#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10518#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:45,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {10518#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10519#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:45,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {10519#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10520#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:45,972 INFO L273 TraceCheckUtils]: 38: Hoare triple {10520#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10521#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:45,973 INFO L273 TraceCheckUtils]: 39: Hoare triple {10521#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10522#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:45,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {10522#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10523#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:45,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {10523#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10524#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:45,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {10524#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10525#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:45,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {10525#(<= main_~i~0 37)} assume !(~i~0 < 100000); {10487#false} is VALID [2018-11-23 12:09:45,977 INFO L273 TraceCheckUtils]: 44: Hoare triple {10487#false} ~i~0 := 1; {10487#false} is VALID [2018-11-23 12:09:45,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,978 INFO L273 TraceCheckUtils]: 48: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,978 INFO L273 TraceCheckUtils]: 49: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,978 INFO L273 TraceCheckUtils]: 50: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,979 INFO L273 TraceCheckUtils]: 52: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,979 INFO L273 TraceCheckUtils]: 53: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10487#false} is VALID [2018-11-23 12:09:45,979 INFO L273 TraceCheckUtils]: 54: Hoare triple {10487#false} assume !(~i~0 < 100000); {10487#false} is VALID [2018-11-23 12:09:45,979 INFO L273 TraceCheckUtils]: 55: Hoare triple {10487#false} ~i~0 := 1;~j~0 := 0; {10487#false} is VALID [2018-11-23 12:09:45,980 INFO L273 TraceCheckUtils]: 56: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {10487#false} is VALID [2018-11-23 12:09:45,980 INFO L256 TraceCheckUtils]: 57: Hoare triple {10487#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10487#false} is VALID [2018-11-23 12:09:45,980 INFO L273 TraceCheckUtils]: 58: Hoare triple {10487#false} ~cond := #in~cond; {10487#false} is VALID [2018-11-23 12:09:45,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {10487#false} assume 0 == ~cond; {10487#false} is VALID [2018-11-23 12:09:45,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {10487#false} assume !false; {10487#false} is VALID [2018-11-23 12:09:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 12:09:45,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:45,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:45,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:09:50,482 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:09:50,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:50,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:50,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {10486#true} call ULTIMATE.init(); {10486#true} is VALID [2018-11-23 12:09:50,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {10486#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10486#true} is VALID [2018-11-23 12:09:50,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {10486#true} assume true; {10486#true} is VALID [2018-11-23 12:09:50,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10486#true} {10486#true} #60#return; {10486#true} is VALID [2018-11-23 12:09:50,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {10486#true} call #t~ret4 := main(); {10486#true} is VALID [2018-11-23 12:09:50,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {10486#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,653 INFO L273 TraceCheckUtils]: 13: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 18: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 35: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 36: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 38: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,657 INFO L273 TraceCheckUtils]: 42: Hoare triple {10486#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {10486#true} is VALID [2018-11-23 12:09:50,657 INFO L273 TraceCheckUtils]: 43: Hoare triple {10486#true} assume !(~i~0 < 100000); {10486#true} is VALID [2018-11-23 12:09:50,657 INFO L273 TraceCheckUtils]: 44: Hoare triple {10486#true} ~i~0 := 1; {10489#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:50,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {10489#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10494#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:50,659 INFO L273 TraceCheckUtils]: 46: Hoare triple {10494#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10499#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:50,659 INFO L273 TraceCheckUtils]: 47: Hoare triple {10499#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10504#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:50,660 INFO L273 TraceCheckUtils]: 48: Hoare triple {10504#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10509#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:50,660 INFO L273 TraceCheckUtils]: 49: Hoare triple {10509#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10514#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:50,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {10514#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10519#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:50,662 INFO L273 TraceCheckUtils]: 51: Hoare triple {10519#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10524#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:50,663 INFO L273 TraceCheckUtils]: 52: Hoare triple {10524#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10685#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:50,664 INFO L273 TraceCheckUtils]: 53: Hoare triple {10685#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {10689#(<= main_~i~0 46)} is VALID [2018-11-23 12:09:50,665 INFO L273 TraceCheckUtils]: 54: Hoare triple {10689#(<= main_~i~0 46)} assume !(~i~0 < 100000); {10487#false} is VALID [2018-11-23 12:09:50,665 INFO L273 TraceCheckUtils]: 55: Hoare triple {10487#false} ~i~0 := 1;~j~0 := 0; {10487#false} is VALID [2018-11-23 12:09:50,665 INFO L273 TraceCheckUtils]: 56: Hoare triple {10487#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {10487#false} is VALID [2018-11-23 12:09:50,665 INFO L256 TraceCheckUtils]: 57: Hoare triple {10487#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10487#false} is VALID [2018-11-23 12:09:50,666 INFO L273 TraceCheckUtils]: 58: Hoare triple {10487#false} ~cond := #in~cond; {10487#false} is VALID [2018-11-23 12:09:50,666 INFO L273 TraceCheckUtils]: 59: Hoare triple {10487#false} assume 0 == ~cond; {10487#false} is VALID [2018-11-23 12:09:50,666 INFO L273 TraceCheckUtils]: 60: Hoare triple {10487#false} assume !false; {10487#false} is VALID [2018-11-23 12:09:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:09:50,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:50,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 42 [2018-11-23 12:09:50,690 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 61 [2018-11-23 12:09:50,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:50,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:09:50,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:50,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:09:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:09:50,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:09:50,749 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 42 states. [2018-11-23 12:09:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:52,142 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2018-11-23 12:09:52,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:09:52,142 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 61 [2018-11-23 12:09:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:09:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 128 transitions. [2018-11-23 12:09:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:09:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 128 transitions. [2018-11-23 12:09:52,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 128 transitions. [2018-11-23 12:09:52,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:52,319 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:09:52,319 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 12:09:52,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:09:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 12:09:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2018-11-23 12:09:52,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:52,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 69 states. [2018-11-23 12:09:52,383 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 69 states. [2018-11-23 12:09:52,383 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 69 states. [2018-11-23 12:09:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:52,387 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-23 12:09:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-23 12:09:52,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:52,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:52,388 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 99 states. [2018-11-23 12:09:52,388 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 99 states. [2018-11-23 12:09:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:52,389 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-23 12:09:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-23 12:09:52,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:52,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:52,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:52,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:09:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-11-23 12:09:52,391 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 61 [2018-11-23 12:09:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:52,391 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-11-23 12:09:52,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:09:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-23 12:09:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:09:52,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:52,392 INFO L402 BasicCegarLoop]: trace histogram [40, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:52,392 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:52,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2141560954, now seen corresponding path program 25 times [2018-11-23 12:09:52,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:52,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:54,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {11248#true} call ULTIMATE.init(); {11248#true} is VALID [2018-11-23 12:09:54,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {11248#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11248#true} is VALID [2018-11-23 12:09:54,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {11248#true} assume true; {11248#true} is VALID [2018-11-23 12:09:54,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11248#true} {11248#true} #60#return; {11248#true} is VALID [2018-11-23 12:09:54,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {11248#true} call #t~ret4 := main(); {11248#true} is VALID [2018-11-23 12:09:54,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {11248#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11250#(= main_~i~0 0)} is VALID [2018-11-23 12:09:54,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {11250#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11251#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:54,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {11251#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11252#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:54,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {11252#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11253#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:54,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {11253#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11254#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:54,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {11254#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11255#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:54,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {11255#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11256#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:54,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {11256#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11257#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:54,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {11257#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11258#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:54,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {11258#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11259#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:54,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {11259#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11260#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:54,057 INFO L273 TraceCheckUtils]: 16: Hoare triple {11260#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11261#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:54,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {11261#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11262#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:54,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {11262#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11263#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:54,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {11263#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11264#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:54,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {11264#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11265#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:54,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {11265#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11266#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:54,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {11266#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11267#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:54,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {11267#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11268#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:54,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {11268#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11269#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:54,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {11269#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11270#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:54,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {11270#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11271#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:54,069 INFO L273 TraceCheckUtils]: 27: Hoare triple {11271#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11272#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:54,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {11272#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11273#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:54,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {11273#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11274#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:54,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {11274#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11275#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:54,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11276#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:54,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11277#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:54,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {11277#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11278#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:54,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {11278#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11279#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:54,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {11279#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11280#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:54,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {11280#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11281#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:54,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {11281#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11282#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:54,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {11282#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11283#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:54,083 INFO L273 TraceCheckUtils]: 39: Hoare triple {11283#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11284#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:54,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {11284#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11285#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:54,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {11285#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11286#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:54,086 INFO L273 TraceCheckUtils]: 42: Hoare triple {11286#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11287#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:54,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {11287#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11288#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:54,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {11288#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11289#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:54,090 INFO L273 TraceCheckUtils]: 45: Hoare triple {11289#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11290#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:54,090 INFO L273 TraceCheckUtils]: 46: Hoare triple {11290#(<= main_~i~0 40)} assume !(~i~0 < 100000); {11249#false} is VALID [2018-11-23 12:09:54,091 INFO L273 TraceCheckUtils]: 47: Hoare triple {11249#false} ~i~0 := 1; {11249#false} is VALID [2018-11-23 12:09:54,091 INFO L273 TraceCheckUtils]: 48: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,092 INFO L273 TraceCheckUtils]: 51: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,092 INFO L273 TraceCheckUtils]: 52: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,092 INFO L273 TraceCheckUtils]: 53: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,092 INFO L273 TraceCheckUtils]: 54: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L273 TraceCheckUtils]: 55: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L273 TraceCheckUtils]: 56: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L273 TraceCheckUtils]: 57: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L273 TraceCheckUtils]: 58: Hoare triple {11249#false} assume !(~i~0 < 100000); {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L273 TraceCheckUtils]: 59: Hoare triple {11249#false} ~i~0 := 1;~j~0 := 0; {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {11249#false} is VALID [2018-11-23 12:09:54,093 INFO L256 TraceCheckUtils]: 61: Hoare triple {11249#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11249#false} is VALID [2018-11-23 12:09:54,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {11249#false} ~cond := #in~cond; {11249#false} is VALID [2018-11-23 12:09:54,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {11249#false} assume 0 == ~cond; {11249#false} is VALID [2018-11-23 12:09:54,094 INFO L273 TraceCheckUtils]: 64: Hoare triple {11249#false} assume !false; {11249#false} is VALID [2018-11-23 12:09:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:54,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:54,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:54,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:54,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {11248#true} call ULTIMATE.init(); {11248#true} is VALID [2018-11-23 12:09:54,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {11248#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11248#true} is VALID [2018-11-23 12:09:54,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {11248#true} assume true; {11248#true} is VALID [2018-11-23 12:09:54,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11248#true} {11248#true} #60#return; {11248#true} is VALID [2018-11-23 12:09:54,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {11248#true} call #t~ret4 := main(); {11248#true} is VALID [2018-11-23 12:09:54,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {11248#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {11309#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:54,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {11309#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11251#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:54,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {11251#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11252#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:54,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {11252#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11253#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:54,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {11253#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11254#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:54,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {11254#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11255#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:54,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {11255#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11256#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:54,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {11256#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11257#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:54,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {11257#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11258#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:54,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {11258#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11259#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:54,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {11259#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11260#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:54,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {11260#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11261#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:54,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {11261#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11262#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:54,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {11262#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11263#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:54,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {11263#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11264#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:54,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {11264#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11265#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:54,528 INFO L273 TraceCheckUtils]: 21: Hoare triple {11265#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11266#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:54,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {11266#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11267#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:54,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {11267#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11268#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:54,531 INFO L273 TraceCheckUtils]: 24: Hoare triple {11268#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11269#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:54,533 INFO L273 TraceCheckUtils]: 25: Hoare triple {11269#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11270#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:54,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {11270#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11271#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:54,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {11271#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11272#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:54,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {11272#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11273#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:54,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {11273#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11274#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:54,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {11274#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11275#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:54,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11276#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:54,540 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11277#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:54,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {11277#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11278#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:54,542 INFO L273 TraceCheckUtils]: 34: Hoare triple {11278#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11279#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:54,543 INFO L273 TraceCheckUtils]: 35: Hoare triple {11279#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11280#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:54,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {11280#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11281#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:54,545 INFO L273 TraceCheckUtils]: 37: Hoare triple {11281#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11282#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:54,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {11282#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11283#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:54,551 INFO L273 TraceCheckUtils]: 39: Hoare triple {11283#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11284#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:54,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {11284#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11285#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:54,569 INFO L273 TraceCheckUtils]: 41: Hoare triple {11285#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11286#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:54,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {11286#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11287#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:54,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {11287#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11288#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:54,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {11288#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11289#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:54,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {11289#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {11290#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:54,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {11290#(<= main_~i~0 40)} assume !(~i~0 < 100000); {11249#false} is VALID [2018-11-23 12:09:54,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {11249#false} ~i~0 := 1; {11249#false} is VALID [2018-11-23 12:09:54,640 INFO L273 TraceCheckUtils]: 48: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,641 INFO L273 TraceCheckUtils]: 49: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,641 INFO L273 TraceCheckUtils]: 51: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,641 INFO L273 TraceCheckUtils]: 53: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,641 INFO L273 TraceCheckUtils]: 54: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,642 INFO L273 TraceCheckUtils]: 55: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,642 INFO L273 TraceCheckUtils]: 56: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,642 INFO L273 TraceCheckUtils]: 57: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {11249#false} is VALID [2018-11-23 12:09:54,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {11249#false} assume !(~i~0 < 100000); {11249#false} is VALID [2018-11-23 12:09:54,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {11249#false} ~i~0 := 1;~j~0 := 0; {11249#false} is VALID [2018-11-23 12:09:54,642 INFO L273 TraceCheckUtils]: 60: Hoare triple {11249#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {11249#false} is VALID [2018-11-23 12:09:54,643 INFO L256 TraceCheckUtils]: 61: Hoare triple {11249#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11249#false} is VALID [2018-11-23 12:09:54,643 INFO L273 TraceCheckUtils]: 62: Hoare triple {11249#false} ~cond := #in~cond; {11249#false} is VALID [2018-11-23 12:09:54,643 INFO L273 TraceCheckUtils]: 63: Hoare triple {11249#false} assume 0 == ~cond; {11249#false} is VALID [2018-11-23 12:09:54,643 INFO L273 TraceCheckUtils]: 64: Hoare triple {11249#false} assume !false; {11249#false} is VALID [2018-11-23 12:09:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:54,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:54,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:09:54,680 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2018-11-23 12:09:54,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:54,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:09:54,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:54,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:09:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:09:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:09:54,796 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 44 states. [2018-11-23 12:09:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:56,104 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2018-11-23 12:09:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:09:56,104 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 65 [2018-11-23 12:09:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:09:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 116 transitions. [2018-11-23 12:09:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:09:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 116 transitions. [2018-11-23 12:09:56,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 116 transitions. [2018-11-23 12:09:56,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:56,219 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:09:56,219 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:09:56,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:09:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:09:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 70. [2018-11-23 12:09:56,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:56,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 70 states. [2018-11-23 12:09:56,296 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 70 states. [2018-11-23 12:09:56,296 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 70 states. [2018-11-23 12:09:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:56,298 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-23 12:09:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-11-23 12:09:56,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:56,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:56,299 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 94 states. [2018-11-23 12:09:56,299 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 94 states. [2018-11-23 12:09:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:56,301 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-23 12:09:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-11-23 12:09:56,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:56,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:56,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:56,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:09:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-23 12:09:56,303 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2018-11-23 12:09:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:56,304 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-23 12:09:56,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:09:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 12:09:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:09:56,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:56,305 INFO L402 BasicCegarLoop]: trace histogram [41, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:56,305 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:56,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash 551158442, now seen corresponding path program 26 times [2018-11-23 12:09:56,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:56,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:56,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:56,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:56,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:57,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-23 12:09:57,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-23 12:09:57,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-23 12:09:57,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #60#return; {12010#true} is VALID [2018-11-23 12:09:57,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret4 := main(); {12010#true} is VALID [2018-11-23 12:09:57,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {12010#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12012#(= main_~i~0 0)} is VALID [2018-11-23 12:09:57,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {12012#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12013#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:57,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {12013#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12014#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:57,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {12014#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12015#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:57,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {12015#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12016#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:57,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {12016#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12017#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:57,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {12017#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12018#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:57,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {12018#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12019#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:57,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {12019#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12020#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:57,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {12020#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12021#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:57,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {12021#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12022#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:57,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {12022#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12023#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:57,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {12023#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12024#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:57,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {12024#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12025#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:57,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {12025#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12026#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:57,233 INFO L273 TraceCheckUtils]: 20: Hoare triple {12026#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12027#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:57,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {12027#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12028#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:57,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {12028#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12029#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:57,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {12029#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12030#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:57,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {12030#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12031#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:57,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {12031#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12032#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:57,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {12032#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12033#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:57,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {12033#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12034#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:57,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {12034#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12035#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:57,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {12035#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12036#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:57,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {12036#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12037#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:57,244 INFO L273 TraceCheckUtils]: 31: Hoare triple {12037#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12038#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:57,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {12038#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12039#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:57,246 INFO L273 TraceCheckUtils]: 33: Hoare triple {12039#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12040#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:57,247 INFO L273 TraceCheckUtils]: 34: Hoare triple {12040#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12041#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:57,248 INFO L273 TraceCheckUtils]: 35: Hoare triple {12041#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12042#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:57,249 INFO L273 TraceCheckUtils]: 36: Hoare triple {12042#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12043#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:57,250 INFO L273 TraceCheckUtils]: 37: Hoare triple {12043#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12044#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:57,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {12044#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12045#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:57,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {12045#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12046#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:57,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {12046#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12047#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:57,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {12047#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12048#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:57,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {12048#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12049#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:57,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {12049#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12050#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:57,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {12050#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12051#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:57,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {12051#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12052#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:57,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {12052#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12053#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:57,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {12053#(<= main_~i~0 41)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-23 12:09:57,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {12011#false} ~i~0 := 1; {12011#false} is VALID [2018-11-23 12:09:57,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,261 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,261 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,261 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,261 INFO L273 TraceCheckUtils]: 54: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,262 INFO L273 TraceCheckUtils]: 56: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,262 INFO L273 TraceCheckUtils]: 58: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {12011#false} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-23 12:09:57,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {12011#false} ~i~0 := 1;~j~0 := 0; {12011#false} is VALID [2018-11-23 12:09:57,263 INFO L273 TraceCheckUtils]: 61: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {12011#false} is VALID [2018-11-23 12:09:57,263 INFO L256 TraceCheckUtils]: 62: Hoare triple {12011#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12011#false} is VALID [2018-11-23 12:09:57,263 INFO L273 TraceCheckUtils]: 63: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-23 12:09:57,263 INFO L273 TraceCheckUtils]: 64: Hoare triple {12011#false} assume 0 == ~cond; {12011#false} is VALID [2018-11-23 12:09:57,263 INFO L273 TraceCheckUtils]: 65: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-23 12:09:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:57,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:57,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:57,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:57,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:57,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:57,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:57,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {12010#true} call ULTIMATE.init(); {12010#true} is VALID [2018-11-23 12:09:57,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {12010#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12010#true} is VALID [2018-11-23 12:09:57,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {12010#true} assume true; {12010#true} is VALID [2018-11-23 12:09:57,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12010#true} {12010#true} #60#return; {12010#true} is VALID [2018-11-23 12:09:57,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {12010#true} call #t~ret4 := main(); {12010#true} is VALID [2018-11-23 12:09:57,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {12010#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12072#(<= main_~i~0 0)} is VALID [2018-11-23 12:09:57,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {12072#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12013#(<= main_~i~0 1)} is VALID [2018-11-23 12:09:57,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {12013#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12014#(<= main_~i~0 2)} is VALID [2018-11-23 12:09:57,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {12014#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12015#(<= main_~i~0 3)} is VALID [2018-11-23 12:09:57,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {12015#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12016#(<= main_~i~0 4)} is VALID [2018-11-23 12:09:57,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {12016#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12017#(<= main_~i~0 5)} is VALID [2018-11-23 12:09:57,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {12017#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12018#(<= main_~i~0 6)} is VALID [2018-11-23 12:09:57,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {12018#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12019#(<= main_~i~0 7)} is VALID [2018-11-23 12:09:57,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {12019#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12020#(<= main_~i~0 8)} is VALID [2018-11-23 12:09:57,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {12020#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12021#(<= main_~i~0 9)} is VALID [2018-11-23 12:09:57,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {12021#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12022#(<= main_~i~0 10)} is VALID [2018-11-23 12:09:57,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {12022#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12023#(<= main_~i~0 11)} is VALID [2018-11-23 12:09:57,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {12023#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12024#(<= main_~i~0 12)} is VALID [2018-11-23 12:09:57,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {12024#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12025#(<= main_~i~0 13)} is VALID [2018-11-23 12:09:57,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {12025#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12026#(<= main_~i~0 14)} is VALID [2018-11-23 12:09:57,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {12026#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12027#(<= main_~i~0 15)} is VALID [2018-11-23 12:09:57,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {12027#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12028#(<= main_~i~0 16)} is VALID [2018-11-23 12:09:57,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {12028#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12029#(<= main_~i~0 17)} is VALID [2018-11-23 12:09:57,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {12029#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12030#(<= main_~i~0 18)} is VALID [2018-11-23 12:09:57,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {12030#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12031#(<= main_~i~0 19)} is VALID [2018-11-23 12:09:57,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {12031#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12032#(<= main_~i~0 20)} is VALID [2018-11-23 12:09:57,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {12032#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12033#(<= main_~i~0 21)} is VALID [2018-11-23 12:09:57,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {12033#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12034#(<= main_~i~0 22)} is VALID [2018-11-23 12:09:57,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {12034#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12035#(<= main_~i~0 23)} is VALID [2018-11-23 12:09:57,624 INFO L273 TraceCheckUtils]: 29: Hoare triple {12035#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12036#(<= main_~i~0 24)} is VALID [2018-11-23 12:09:57,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {12036#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12037#(<= main_~i~0 25)} is VALID [2018-11-23 12:09:57,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {12037#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12038#(<= main_~i~0 26)} is VALID [2018-11-23 12:09:57,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {12038#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12039#(<= main_~i~0 27)} is VALID [2018-11-23 12:09:57,628 INFO L273 TraceCheckUtils]: 33: Hoare triple {12039#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12040#(<= main_~i~0 28)} is VALID [2018-11-23 12:09:57,629 INFO L273 TraceCheckUtils]: 34: Hoare triple {12040#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12041#(<= main_~i~0 29)} is VALID [2018-11-23 12:09:57,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {12041#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12042#(<= main_~i~0 30)} is VALID [2018-11-23 12:09:57,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {12042#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12043#(<= main_~i~0 31)} is VALID [2018-11-23 12:09:57,632 INFO L273 TraceCheckUtils]: 37: Hoare triple {12043#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12044#(<= main_~i~0 32)} is VALID [2018-11-23 12:09:57,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {12044#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12045#(<= main_~i~0 33)} is VALID [2018-11-23 12:09:57,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {12045#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12046#(<= main_~i~0 34)} is VALID [2018-11-23 12:09:57,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {12046#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12047#(<= main_~i~0 35)} is VALID [2018-11-23 12:09:57,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {12047#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12048#(<= main_~i~0 36)} is VALID [2018-11-23 12:09:57,637 INFO L273 TraceCheckUtils]: 42: Hoare triple {12048#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12049#(<= main_~i~0 37)} is VALID [2018-11-23 12:09:57,638 INFO L273 TraceCheckUtils]: 43: Hoare triple {12049#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12050#(<= main_~i~0 38)} is VALID [2018-11-23 12:09:57,639 INFO L273 TraceCheckUtils]: 44: Hoare triple {12050#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12051#(<= main_~i~0 39)} is VALID [2018-11-23 12:09:57,640 INFO L273 TraceCheckUtils]: 45: Hoare triple {12051#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12052#(<= main_~i~0 40)} is VALID [2018-11-23 12:09:57,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {12052#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12053#(<= main_~i~0 41)} is VALID [2018-11-23 12:09:57,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {12053#(<= main_~i~0 41)} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-23 12:09:57,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {12011#false} ~i~0 := 1; {12011#false} is VALID [2018-11-23 12:09:57,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12011#false} is VALID [2018-11-23 12:09:57,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {12011#false} assume !(~i~0 < 100000); {12011#false} is VALID [2018-11-23 12:09:57,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {12011#false} ~i~0 := 1;~j~0 := 0; {12011#false} is VALID [2018-11-23 12:09:57,645 INFO L273 TraceCheckUtils]: 61: Hoare triple {12011#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {12011#false} is VALID [2018-11-23 12:09:57,645 INFO L256 TraceCheckUtils]: 62: Hoare triple {12011#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12011#false} is VALID [2018-11-23 12:09:57,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {12011#false} ~cond := #in~cond; {12011#false} is VALID [2018-11-23 12:09:57,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {12011#false} assume 0 == ~cond; {12011#false} is VALID [2018-11-23 12:09:57,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {12011#false} assume !false; {12011#false} is VALID [2018-11-23 12:09:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:09:57,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:57,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:09:57,668 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 66 [2018-11-23 12:09:57,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:57,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:09:57,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:57,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:09:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:09:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:09:57,715 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 45 states. [2018-11-23 12:09:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:58,946 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-11-23 12:09:58,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:09:58,946 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 66 [2018-11-23 12:09:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:09:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 122 transitions. [2018-11-23 12:09:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:09:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 122 transitions. [2018-11-23 12:09:58,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 122 transitions. [2018-11-23 12:09:59,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:59,059 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:09:59,059 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:09:59,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:09:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:09:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2018-11-23 12:09:59,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:59,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 71 states. [2018-11-23 12:09:59,118 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 71 states. [2018-11-23 12:09:59,118 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 71 states. [2018-11-23 12:09:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,120 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-11-23 12:09:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-11-23 12:09:59,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:59,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:59,120 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 98 states. [2018-11-23 12:09:59,121 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 98 states. [2018-11-23 12:09:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:59,123 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-11-23 12:09:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-11-23 12:09:59,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:59,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:59,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:59,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:09:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-23 12:09:59,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2018-11-23 12:09:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:59,125 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-23 12:09:59,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:09:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 12:09:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:09:59,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:59,126 INFO L402 BasicCegarLoop]: trace histogram [42, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:59,127 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:59,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1873886202, now seen corresponding path program 27 times [2018-11-23 12:09:59,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:59,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:59,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:00,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {12793#true} call ULTIMATE.init(); {12793#true} is VALID [2018-11-23 12:10:00,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {12793#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12793#true} is VALID [2018-11-23 12:10:00,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {12793#true} assume true; {12793#true} is VALID [2018-11-23 12:10:00,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12793#true} {12793#true} #60#return; {12793#true} is VALID [2018-11-23 12:10:00,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {12793#true} call #t~ret4 := main(); {12793#true} is VALID [2018-11-23 12:10:00,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {12793#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12795#(= main_~i~0 0)} is VALID [2018-11-23 12:10:00,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {12795#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12796#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:00,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {12796#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12797#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:00,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {12797#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12798#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:00,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {12798#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12799#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:00,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {12799#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12800#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:00,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {12800#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12801#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:00,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {12801#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12802#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:00,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {12802#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12803#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:00,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {12803#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12804#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:00,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {12804#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12805#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:00,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {12805#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12806#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:00,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {12806#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12807#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:00,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {12807#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12808#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:00,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {12808#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12809#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:00,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {12809#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12810#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:00,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {12810#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12811#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:00,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {12811#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12812#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:00,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {12812#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12813#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:00,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {12813#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12814#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:00,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {12814#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12815#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:00,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {12815#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12816#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:00,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {12816#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12817#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:00,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {12817#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12818#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:00,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {12818#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12819#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:00,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {12819#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12820#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:00,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {12820#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12821#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:00,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {12821#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12822#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:00,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {12822#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12823#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:00,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {12823#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12824#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:00,172 INFO L273 TraceCheckUtils]: 35: Hoare triple {12824#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12825#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:00,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {12825#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12826#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:00,173 INFO L273 TraceCheckUtils]: 37: Hoare triple {12826#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12827#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:00,174 INFO L273 TraceCheckUtils]: 38: Hoare triple {12827#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12828#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:00,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {12828#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12829#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:00,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {12829#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12830#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:00,177 INFO L273 TraceCheckUtils]: 41: Hoare triple {12830#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12831#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:00,178 INFO L273 TraceCheckUtils]: 42: Hoare triple {12831#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12832#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:00,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {12832#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12833#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:00,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {12833#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12834#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:00,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {12834#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12835#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:00,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {12835#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12836#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:00,183 INFO L273 TraceCheckUtils]: 47: Hoare triple {12836#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12837#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:00,184 INFO L273 TraceCheckUtils]: 48: Hoare triple {12837#(<= main_~i~0 42)} assume !(~i~0 < 100000); {12794#false} is VALID [2018-11-23 12:10:00,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {12794#false} ~i~0 := 1; {12794#false} is VALID [2018-11-23 12:10:00,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,186 INFO L273 TraceCheckUtils]: 58: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12794#false} is VALID [2018-11-23 12:10:00,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {12794#false} assume !(~i~0 < 100000); {12794#false} is VALID [2018-11-23 12:10:00,187 INFO L273 TraceCheckUtils]: 61: Hoare triple {12794#false} ~i~0 := 1;~j~0 := 0; {12794#false} is VALID [2018-11-23 12:10:00,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {12794#false} is VALID [2018-11-23 12:10:00,187 INFO L256 TraceCheckUtils]: 63: Hoare triple {12794#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12794#false} is VALID [2018-11-23 12:10:00,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {12794#false} ~cond := #in~cond; {12794#false} is VALID [2018-11-23 12:10:00,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {12794#false} assume 0 == ~cond; {12794#false} is VALID [2018-11-23 12:10:00,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {12794#false} assume !false; {12794#false} is VALID [2018-11-23 12:10:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 12:10:00,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:00,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:10:00,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:10:00,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:00,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:01,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {12793#true} call ULTIMATE.init(); {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {12793#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {12793#true} assume true; {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12793#true} {12793#true} #60#return; {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {12793#true} call #t~ret4 := main(); {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {12793#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,113 INFO L273 TraceCheckUtils]: 34: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 38: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,115 INFO L273 TraceCheckUtils]: 47: Hoare triple {12793#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {12793#true} is VALID [2018-11-23 12:10:01,115 INFO L273 TraceCheckUtils]: 48: Hoare triple {12793#true} assume !(~i~0 < 100000); {12793#true} is VALID [2018-11-23 12:10:01,116 INFO L273 TraceCheckUtils]: 49: Hoare triple {12793#true} ~i~0 := 1; {12796#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:01,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {12796#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12801#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:01,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {12801#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12806#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:01,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {12806#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12811#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:01,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {12811#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12816#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:01,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {12816#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12821#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:01,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {12821#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12826#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:01,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {12826#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12831#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:01,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {12831#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {12836#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:01,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {12836#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13015#(<= main_~i~0 46)} is VALID [2018-11-23 12:10:01,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {13015#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13019#(<= main_~i~0 51)} is VALID [2018-11-23 12:10:01,126 INFO L273 TraceCheckUtils]: 60: Hoare triple {13019#(<= main_~i~0 51)} assume !(~i~0 < 100000); {12794#false} is VALID [2018-11-23 12:10:01,127 INFO L273 TraceCheckUtils]: 61: Hoare triple {12794#false} ~i~0 := 1;~j~0 := 0; {12794#false} is VALID [2018-11-23 12:10:01,127 INFO L273 TraceCheckUtils]: 62: Hoare triple {12794#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {12794#false} is VALID [2018-11-23 12:10:01,127 INFO L256 TraceCheckUtils]: 63: Hoare triple {12794#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12794#false} is VALID [2018-11-23 12:10:01,127 INFO L273 TraceCheckUtils]: 64: Hoare triple {12794#false} ~cond := #in~cond; {12794#false} is VALID [2018-11-23 12:10:01,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {12794#false} assume 0 == ~cond; {12794#false} is VALID [2018-11-23 12:10:01,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {12794#false} assume !false; {12794#false} is VALID [2018-11-23 12:10:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-11-23 12:10:01,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:01,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 13] total 47 [2018-11-23 12:10:01,151 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 67 [2018-11-23 12:10:01,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:01,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:10:01,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:01,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:10:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:10:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:10:01,220 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 47 states. [2018-11-23 12:10:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:03,125 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2018-11-23 12:10:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:10:03,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 67 [2018-11-23 12:10:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:10:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 138 transitions. [2018-11-23 12:10:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:10:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 138 transitions. [2018-11-23 12:10:03,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 138 transitions. [2018-11-23 12:10:03,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:03,282 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:10:03,282 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:10:03,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:10:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:10:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2018-11-23 12:10:03,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:03,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 75 states. [2018-11-23 12:10:03,392 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 75 states. [2018-11-23 12:10:03,392 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 75 states. [2018-11-23 12:10:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:03,394 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-11-23 12:10:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-11-23 12:10:03,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:03,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:03,395 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 108 states. [2018-11-23 12:10:03,395 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 108 states. [2018-11-23 12:10:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:03,397 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-11-23 12:10:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-11-23 12:10:03,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:03,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:03,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:03,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:10:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-11-23 12:10:03,400 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 67 [2018-11-23 12:10:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:03,400 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-11-23 12:10:03,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:10:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 12:10:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:10:03,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:03,401 INFO L402 BasicCegarLoop]: trace histogram [45, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:03,401 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:03,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash -557466139, now seen corresponding path program 28 times [2018-11-23 12:10:03,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:03,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:03,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:04,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {13627#true} call ULTIMATE.init(); {13627#true} is VALID [2018-11-23 12:10:04,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {13627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13627#true} is VALID [2018-11-23 12:10:04,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {13627#true} assume true; {13627#true} is VALID [2018-11-23 12:10:04,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13627#true} {13627#true} #60#return; {13627#true} is VALID [2018-11-23 12:10:04,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {13627#true} call #t~ret4 := main(); {13627#true} is VALID [2018-11-23 12:10:04,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {13627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {13629#(= main_~i~0 0)} is VALID [2018-11-23 12:10:04,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {13629#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13630#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:04,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {13630#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13631#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:04,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {13631#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13632#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:04,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {13632#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13633#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:04,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {13633#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13634#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:04,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {13634#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13635#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:04,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {13635#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13636#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:04,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {13636#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13637#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:04,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {13637#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13638#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:04,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {13638#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13639#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:04,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {13639#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13640#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:04,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {13640#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13641#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:04,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {13641#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13642#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:04,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {13642#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13643#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:04,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {13643#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13644#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:04,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {13644#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13645#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:04,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {13645#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13646#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:04,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {13646#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13647#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:04,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {13647#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13648#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:04,550 INFO L273 TraceCheckUtils]: 25: Hoare triple {13648#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13649#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:04,551 INFO L273 TraceCheckUtils]: 26: Hoare triple {13649#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13650#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:04,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {13650#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13651#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:04,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {13651#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13652#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:04,553 INFO L273 TraceCheckUtils]: 29: Hoare triple {13652#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13653#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:04,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {13653#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13654#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:04,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {13654#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13655#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:04,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {13655#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13656#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:04,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {13656#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13657#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:04,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {13657#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13658#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:04,559 INFO L273 TraceCheckUtils]: 35: Hoare triple {13658#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13659#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:04,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {13659#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13660#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:04,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {13660#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13661#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:04,562 INFO L273 TraceCheckUtils]: 38: Hoare triple {13661#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13662#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:04,563 INFO L273 TraceCheckUtils]: 39: Hoare triple {13662#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13663#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:04,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {13663#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13664#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:04,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {13664#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13665#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:04,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {13665#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13666#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:04,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {13666#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13667#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:04,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {13667#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13668#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:04,569 INFO L273 TraceCheckUtils]: 45: Hoare triple {13668#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13669#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:04,570 INFO L273 TraceCheckUtils]: 46: Hoare triple {13669#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13670#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:04,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {13670#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13671#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:04,572 INFO L273 TraceCheckUtils]: 48: Hoare triple {13671#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13672#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:04,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {13672#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13673#(<= main_~i~0 44)} is VALID [2018-11-23 12:10:04,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {13673#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13674#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:04,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {13674#(<= main_~i~0 45)} assume !(~i~0 < 100000); {13628#false} is VALID [2018-11-23 12:10:04,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {13628#false} ~i~0 := 1; {13628#false} is VALID [2018-11-23 12:10:04,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,575 INFO L273 TraceCheckUtils]: 54: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,575 INFO L273 TraceCheckUtils]: 55: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,575 INFO L273 TraceCheckUtils]: 56: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,575 INFO L273 TraceCheckUtils]: 57: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,576 INFO L273 TraceCheckUtils]: 58: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,576 INFO L273 TraceCheckUtils]: 59: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,576 INFO L273 TraceCheckUtils]: 60: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,576 INFO L273 TraceCheckUtils]: 61: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,576 INFO L273 TraceCheckUtils]: 62: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:04,577 INFO L273 TraceCheckUtils]: 64: Hoare triple {13628#false} assume !(~i~0 < 100000); {13628#false} is VALID [2018-11-23 12:10:04,577 INFO L273 TraceCheckUtils]: 65: Hoare triple {13628#false} ~i~0 := 1;~j~0 := 0; {13628#false} is VALID [2018-11-23 12:10:04,577 INFO L273 TraceCheckUtils]: 66: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {13628#false} is VALID [2018-11-23 12:10:04,577 INFO L256 TraceCheckUtils]: 67: Hoare triple {13628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13628#false} is VALID [2018-11-23 12:10:04,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {13628#false} ~cond := #in~cond; {13628#false} is VALID [2018-11-23 12:10:04,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {13628#false} assume 0 == ~cond; {13628#false} is VALID [2018-11-23 12:10:04,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {13628#false} assume !false; {13628#false} is VALID [2018-11-23 12:10:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:04,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:04,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:04,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:04,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:04,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:04,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:04,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {13627#true} call ULTIMATE.init(); {13627#true} is VALID [2018-11-23 12:10:04,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {13627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13627#true} is VALID [2018-11-23 12:10:04,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {13627#true} assume true; {13627#true} is VALID [2018-11-23 12:10:04,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13627#true} {13627#true} #60#return; {13627#true} is VALID [2018-11-23 12:10:04,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {13627#true} call #t~ret4 := main(); {13627#true} is VALID [2018-11-23 12:10:04,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {13627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {13693#(<= main_~i~0 0)} is VALID [2018-11-23 12:10:04,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {13693#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13630#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:04,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {13630#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13631#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:04,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {13631#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13632#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:04,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {13632#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13633#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:04,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {13633#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13634#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:04,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {13634#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13635#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:04,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {13635#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13636#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:04,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {13636#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13637#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:04,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {13637#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13638#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:04,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {13638#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13639#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:04,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {13639#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13640#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:04,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {13640#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13641#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:04,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {13641#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13642#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:04,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {13642#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13643#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:04,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {13643#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13644#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:04,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {13644#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13645#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:04,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {13645#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13646#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:04,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {13646#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13647#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:04,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {13647#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13648#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:04,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {13648#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13649#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:04,977 INFO L273 TraceCheckUtils]: 26: Hoare triple {13649#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13650#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:04,978 INFO L273 TraceCheckUtils]: 27: Hoare triple {13650#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13651#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:04,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {13651#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13652#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:04,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {13652#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13653#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:04,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {13653#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13654#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:04,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {13654#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13655#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:04,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {13655#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13656#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:04,983 INFO L273 TraceCheckUtils]: 33: Hoare triple {13656#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13657#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:04,984 INFO L273 TraceCheckUtils]: 34: Hoare triple {13657#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13658#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:04,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {13658#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13659#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:04,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {13659#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13660#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:04,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {13660#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13661#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:04,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {13661#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13662#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:04,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {13662#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13663#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:04,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {13663#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13664#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:04,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {13664#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13665#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:04,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {13665#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13666#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:04,992 INFO L273 TraceCheckUtils]: 43: Hoare triple {13666#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13667#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:04,993 INFO L273 TraceCheckUtils]: 44: Hoare triple {13667#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13668#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:04,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {13668#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13669#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:04,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {13669#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13670#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:04,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {13670#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13671#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:04,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {13671#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13672#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:04,998 INFO L273 TraceCheckUtils]: 49: Hoare triple {13672#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13673#(<= main_~i~0 44)} is VALID [2018-11-23 12:10:04,999 INFO L273 TraceCheckUtils]: 50: Hoare triple {13673#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {13674#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:04,999 INFO L273 TraceCheckUtils]: 51: Hoare triple {13674#(<= main_~i~0 45)} assume !(~i~0 < 100000); {13628#false} is VALID [2018-11-23 12:10:05,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {13628#false} ~i~0 := 1; {13628#false} is VALID [2018-11-23 12:10:05,000 INFO L273 TraceCheckUtils]: 53: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,001 INFO L273 TraceCheckUtils]: 59: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {13628#false} is VALID [2018-11-23 12:10:05,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {13628#false} assume !(~i~0 < 100000); {13628#false} is VALID [2018-11-23 12:10:05,002 INFO L273 TraceCheckUtils]: 65: Hoare triple {13628#false} ~i~0 := 1;~j~0 := 0; {13628#false} is VALID [2018-11-23 12:10:05,002 INFO L273 TraceCheckUtils]: 66: Hoare triple {13628#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {13628#false} is VALID [2018-11-23 12:10:05,003 INFO L256 TraceCheckUtils]: 67: Hoare triple {13628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13628#false} is VALID [2018-11-23 12:10:05,003 INFO L273 TraceCheckUtils]: 68: Hoare triple {13628#false} ~cond := #in~cond; {13628#false} is VALID [2018-11-23 12:10:05,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {13628#false} assume 0 == ~cond; {13628#false} is VALID [2018-11-23 12:10:05,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {13628#false} assume !false; {13628#false} is VALID [2018-11-23 12:10:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:05,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:05,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 12:10:05,026 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 71 [2018-11-23 12:10:05,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:05,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:10:05,070 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 12:10:05,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:10:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:10:05,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:10:05,072 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 49 states. [2018-11-23 12:10:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:06,614 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2018-11-23 12:10:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:10:06,614 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 71 [2018-11-23 12:10:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:10:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 126 transitions. [2018-11-23 12:10:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:10:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 126 transitions. [2018-11-23 12:10:06,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 126 transitions. [2018-11-23 12:10:06,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:06,759 INFO L225 Difference]: With dead ends: 126 [2018-11-23 12:10:06,759 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:10:06,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:10:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:10:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2018-11-23 12:10:06,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:06,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 76 states. [2018-11-23 12:10:06,814 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 76 states. [2018-11-23 12:10:06,815 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 76 states. [2018-11-23 12:10:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:06,816 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-23 12:10:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-23 12:10:06,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:06,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:06,817 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 103 states. [2018-11-23 12:10:06,817 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 103 states. [2018-11-23 12:10:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:06,819 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-23 12:10:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-23 12:10:06,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:06,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:06,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:06,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 12:10:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 12:10:06,821 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2018-11-23 12:10:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:06,822 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 12:10:06,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:10:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:10:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:10:06,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:06,823 INFO L402 BasicCegarLoop]: trace histogram [46, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:06,823 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:06,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -333482487, now seen corresponding path program 29 times [2018-11-23 12:10:06,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:06,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:09,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {14461#true} call ULTIMATE.init(); {14461#true} is VALID [2018-11-23 12:10:09,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {14461#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14461#true} is VALID [2018-11-23 12:10:09,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {14461#true} assume true; {14461#true} is VALID [2018-11-23 12:10:09,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14461#true} {14461#true} #60#return; {14461#true} is VALID [2018-11-23 12:10:09,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {14461#true} call #t~ret4 := main(); {14461#true} is VALID [2018-11-23 12:10:09,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {14461#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {14463#(= main_~i~0 0)} is VALID [2018-11-23 12:10:09,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {14463#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14464#(<= main_~i~0 1)} is VALID [2018-11-23 12:10:09,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {14464#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14465#(<= main_~i~0 2)} is VALID [2018-11-23 12:10:09,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {14465#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14466#(<= main_~i~0 3)} is VALID [2018-11-23 12:10:09,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {14466#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14467#(<= main_~i~0 4)} is VALID [2018-11-23 12:10:09,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {14467#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14468#(<= main_~i~0 5)} is VALID [2018-11-23 12:10:09,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {14468#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14469#(<= main_~i~0 6)} is VALID [2018-11-23 12:10:09,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {14469#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14470#(<= main_~i~0 7)} is VALID [2018-11-23 12:10:09,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {14470#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14471#(<= main_~i~0 8)} is VALID [2018-11-23 12:10:09,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {14471#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14472#(<= main_~i~0 9)} is VALID [2018-11-23 12:10:09,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {14472#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14473#(<= main_~i~0 10)} is VALID [2018-11-23 12:10:09,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {14473#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14474#(<= main_~i~0 11)} is VALID [2018-11-23 12:10:09,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {14474#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14475#(<= main_~i~0 12)} is VALID [2018-11-23 12:10:09,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {14475#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14476#(<= main_~i~0 13)} is VALID [2018-11-23 12:10:09,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {14476#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14477#(<= main_~i~0 14)} is VALID [2018-11-23 12:10:09,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {14477#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14478#(<= main_~i~0 15)} is VALID [2018-11-23 12:10:09,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {14478#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14479#(<= main_~i~0 16)} is VALID [2018-11-23 12:10:09,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {14479#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14480#(<= main_~i~0 17)} is VALID [2018-11-23 12:10:09,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {14480#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14481#(<= main_~i~0 18)} is VALID [2018-11-23 12:10:09,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {14481#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14482#(<= main_~i~0 19)} is VALID [2018-11-23 12:10:09,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {14482#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14483#(<= main_~i~0 20)} is VALID [2018-11-23 12:10:09,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {14483#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14484#(<= main_~i~0 21)} is VALID [2018-11-23 12:10:09,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {14484#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14485#(<= main_~i~0 22)} is VALID [2018-11-23 12:10:09,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {14485#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14486#(<= main_~i~0 23)} is VALID [2018-11-23 12:10:09,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {14486#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14487#(<= main_~i~0 24)} is VALID [2018-11-23 12:10:09,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {14487#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14488#(<= main_~i~0 25)} is VALID [2018-11-23 12:10:09,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {14488#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14489#(<= main_~i~0 26)} is VALID [2018-11-23 12:10:09,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {14489#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14490#(<= main_~i~0 27)} is VALID [2018-11-23 12:10:09,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {14490#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14491#(<= main_~i~0 28)} is VALID [2018-11-23 12:10:09,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {14491#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14492#(<= main_~i~0 29)} is VALID [2018-11-23 12:10:09,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {14492#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14493#(<= main_~i~0 30)} is VALID [2018-11-23 12:10:09,282 INFO L273 TraceCheckUtils]: 36: Hoare triple {14493#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14494#(<= main_~i~0 31)} is VALID [2018-11-23 12:10:09,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {14494#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14495#(<= main_~i~0 32)} is VALID [2018-11-23 12:10:09,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {14495#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14496#(<= main_~i~0 33)} is VALID [2018-11-23 12:10:09,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {14496#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14497#(<= main_~i~0 34)} is VALID [2018-11-23 12:10:09,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {14497#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14498#(<= main_~i~0 35)} is VALID [2018-11-23 12:10:09,287 INFO L273 TraceCheckUtils]: 41: Hoare triple {14498#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14499#(<= main_~i~0 36)} is VALID [2018-11-23 12:10:09,288 INFO L273 TraceCheckUtils]: 42: Hoare triple {14499#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14500#(<= main_~i~0 37)} is VALID [2018-11-23 12:10:09,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {14500#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14501#(<= main_~i~0 38)} is VALID [2018-11-23 12:10:09,290 INFO L273 TraceCheckUtils]: 44: Hoare triple {14501#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14502#(<= main_~i~0 39)} is VALID [2018-11-23 12:10:09,291 INFO L273 TraceCheckUtils]: 45: Hoare triple {14502#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14503#(<= main_~i~0 40)} is VALID [2018-11-23 12:10:09,292 INFO L273 TraceCheckUtils]: 46: Hoare triple {14503#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14504#(<= main_~i~0 41)} is VALID [2018-11-23 12:10:09,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {14504#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14505#(<= main_~i~0 42)} is VALID [2018-11-23 12:10:09,294 INFO L273 TraceCheckUtils]: 48: Hoare triple {14505#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14506#(<= main_~i~0 43)} is VALID [2018-11-23 12:10:09,295 INFO L273 TraceCheckUtils]: 49: Hoare triple {14506#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14507#(<= main_~i~0 44)} is VALID [2018-11-23 12:10:09,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {14507#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14508#(<= main_~i~0 45)} is VALID [2018-11-23 12:10:09,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {14508#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14509#(<= main_~i~0 46)} is VALID [2018-11-23 12:10:09,297 INFO L273 TraceCheckUtils]: 52: Hoare triple {14509#(<= main_~i~0 46)} assume !(~i~0 < 100000); {14462#false} is VALID [2018-11-23 12:10:09,298 INFO L273 TraceCheckUtils]: 53: Hoare triple {14462#false} ~i~0 := 1; {14462#false} is VALID [2018-11-23 12:10:09,298 INFO L273 TraceCheckUtils]: 54: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,298 INFO L273 TraceCheckUtils]: 56: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,298 INFO L273 TraceCheckUtils]: 57: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,299 INFO L273 TraceCheckUtils]: 58: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,299 INFO L273 TraceCheckUtils]: 59: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,299 INFO L273 TraceCheckUtils]: 60: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,299 INFO L273 TraceCheckUtils]: 61: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,299 INFO L273 TraceCheckUtils]: 62: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,299 INFO L273 TraceCheckUtils]: 63: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,300 INFO L273 TraceCheckUtils]: 64: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:10:09,300 INFO L273 TraceCheckUtils]: 65: Hoare triple {14462#false} assume !(~i~0 < 100000); {14462#false} is VALID [2018-11-23 12:10:09,300 INFO L273 TraceCheckUtils]: 66: Hoare triple {14462#false} ~i~0 := 1;~j~0 := 0; {14462#false} is VALID [2018-11-23 12:10:09,300 INFO L273 TraceCheckUtils]: 67: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {14462#false} is VALID [2018-11-23 12:10:09,301 INFO L256 TraceCheckUtils]: 68: Hoare triple {14462#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14462#false} is VALID [2018-11-23 12:10:09,301 INFO L273 TraceCheckUtils]: 69: Hoare triple {14462#false} ~cond := #in~cond; {14462#false} is VALID [2018-11-23 12:10:09,301 INFO L273 TraceCheckUtils]: 70: Hoare triple {14462#false} assume 0 == ~cond; {14462#false} is VALID [2018-11-23 12:10:09,301 INFO L273 TraceCheckUtils]: 71: Hoare triple {14462#false} assume !false; {14462#false} is VALID [2018-11-23 12:10:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:10:09,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:09,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:10:09,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:01,562 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:11:01,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:01,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:01,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {14461#true} call ULTIMATE.init(); {14461#true} is VALID [2018-11-23 12:11:01,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {14461#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14461#true} is VALID [2018-11-23 12:11:01,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {14461#true} assume true; {14461#true} is VALID [2018-11-23 12:11:01,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14461#true} {14461#true} #60#return; {14461#true} is VALID [2018-11-23 12:11:01,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {14461#true} call #t~ret4 := main(); {14461#true} is VALID [2018-11-23 12:11:01,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {14461#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {14528#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:01,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {14528#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14464#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:01,895 INFO L273 TraceCheckUtils]: 7: Hoare triple {14464#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14465#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:01,896 INFO L273 TraceCheckUtils]: 8: Hoare triple {14465#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14466#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:01,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {14466#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14467#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:01,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {14467#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14468#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:01,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {14468#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14469#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:01,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {14469#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14470#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:01,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {14470#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14471#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:01,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {14471#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14472#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:01,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {14472#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14473#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:01,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {14473#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14474#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:01,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {14474#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14475#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:01,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {14475#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14476#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:01,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {14476#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14477#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:01,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {14477#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14478#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:01,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {14478#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14479#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:01,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {14479#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14480#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:01,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {14480#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14481#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:01,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {14481#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14482#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:01,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {14482#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14483#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:01,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {14483#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14484#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:01,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {14484#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14485#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:01,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {14485#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14486#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:01,918 INFO L273 TraceCheckUtils]: 29: Hoare triple {14486#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14487#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:01,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {14487#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14488#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:01,920 INFO L273 TraceCheckUtils]: 31: Hoare triple {14488#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14489#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:01,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {14489#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14490#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:01,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {14490#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14491#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:01,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {14491#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14492#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:01,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {14492#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14493#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:01,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {14493#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14494#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:01,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {14494#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14495#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:01,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {14495#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14496#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:01,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {14496#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14497#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:01,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {14497#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14498#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:01,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {14498#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14499#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:01,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {14499#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14500#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:01,932 INFO L273 TraceCheckUtils]: 43: Hoare triple {14500#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14501#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:01,933 INFO L273 TraceCheckUtils]: 44: Hoare triple {14501#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14502#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:01,934 INFO L273 TraceCheckUtils]: 45: Hoare triple {14502#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14503#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:01,935 INFO L273 TraceCheckUtils]: 46: Hoare triple {14503#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14504#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:01,936 INFO L273 TraceCheckUtils]: 47: Hoare triple {14504#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14505#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:01,937 INFO L273 TraceCheckUtils]: 48: Hoare triple {14505#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14506#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:01,938 INFO L273 TraceCheckUtils]: 49: Hoare triple {14506#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14507#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:01,939 INFO L273 TraceCheckUtils]: 50: Hoare triple {14507#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14508#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:01,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {14508#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {14509#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:01,941 INFO L273 TraceCheckUtils]: 52: Hoare triple {14509#(<= main_~i~0 46)} assume !(~i~0 < 100000); {14462#false} is VALID [2018-11-23 12:11:01,941 INFO L273 TraceCheckUtils]: 53: Hoare triple {14462#false} ~i~0 := 1; {14462#false} is VALID [2018-11-23 12:11:01,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,941 INFO L273 TraceCheckUtils]: 55: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,941 INFO L273 TraceCheckUtils]: 56: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,942 INFO L273 TraceCheckUtils]: 57: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,942 INFO L273 TraceCheckUtils]: 58: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,942 INFO L273 TraceCheckUtils]: 59: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,942 INFO L273 TraceCheckUtils]: 60: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,943 INFO L273 TraceCheckUtils]: 62: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,943 INFO L273 TraceCheckUtils]: 63: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {14462#false} is VALID [2018-11-23 12:11:01,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {14462#false} assume !(~i~0 < 100000); {14462#false} is VALID [2018-11-23 12:11:01,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {14462#false} ~i~0 := 1;~j~0 := 0; {14462#false} is VALID [2018-11-23 12:11:01,944 INFO L273 TraceCheckUtils]: 67: Hoare triple {14462#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {14462#false} is VALID [2018-11-23 12:11:01,944 INFO L256 TraceCheckUtils]: 68: Hoare triple {14462#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14462#false} is VALID [2018-11-23 12:11:01,944 INFO L273 TraceCheckUtils]: 69: Hoare triple {14462#false} ~cond := #in~cond; {14462#false} is VALID [2018-11-23 12:11:01,944 INFO L273 TraceCheckUtils]: 70: Hoare triple {14462#false} assume 0 == ~cond; {14462#false} is VALID [2018-11-23 12:11:01,944 INFO L273 TraceCheckUtils]: 71: Hoare triple {14462#false} assume !false; {14462#false} is VALID [2018-11-23 12:11:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:11:01,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:01,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-11-23 12:11:01,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-11-23 12:11:01,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:01,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:11:02,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:02,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:11:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:11:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:11:02,028 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 50 states. [2018-11-23 12:11:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:03,882 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-23 12:11:03,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:11:03,882 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-11-23 12:11:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:11:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 132 transitions. [2018-11-23 12:11:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:11:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 132 transitions. [2018-11-23 12:11:03,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 132 transitions. [2018-11-23 12:11:04,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:04,036 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:11:04,037 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 12:11:04,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:11:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 12:11:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2018-11-23 12:11:04,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:04,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 77 states. [2018-11-23 12:11:04,109 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 77 states. [2018-11-23 12:11:04,110 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 77 states. [2018-11-23 12:11:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:04,112 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-11-23 12:11:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-11-23 12:11:04,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:04,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:04,113 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 107 states. [2018-11-23 12:11:04,113 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 107 states. [2018-11-23 12:11:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:04,115 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-11-23 12:11:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-11-23 12:11:04,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:04,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:04,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:04,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:11:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-11-23 12:11:04,118 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2018-11-23 12:11:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-23 12:11:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:11:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 12:11:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:11:04,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:04,119 INFO L402 BasicCegarLoop]: trace histogram [47, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:04,119 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:04,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1979923867, now seen corresponding path program 30 times [2018-11-23 12:11:04,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:04,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:04,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:05,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15316#true} is VALID [2018-11-23 12:11:05,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {15316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15316#true} is VALID [2018-11-23 12:11:05,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2018-11-23 12:11:05,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #60#return; {15316#true} is VALID [2018-11-23 12:11:05,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret4 := main(); {15316#true} is VALID [2018-11-23 12:11:05,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {15316#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {15318#(= main_~i~0 0)} is VALID [2018-11-23 12:11:05,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {15318#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15319#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:05,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {15319#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15320#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:05,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {15320#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15321#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:05,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {15321#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15322#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:05,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {15322#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15323#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:05,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {15323#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15324#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:05,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {15324#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15325#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:05,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {15325#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15326#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:05,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {15326#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15327#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:05,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {15327#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15328#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:05,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {15328#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15329#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:05,813 INFO L273 TraceCheckUtils]: 17: Hoare triple {15329#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15330#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:05,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {15330#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15331#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:05,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {15331#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15332#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:05,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {15332#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15333#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:05,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {15333#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15334#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:05,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {15334#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15335#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:05,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {15335#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15336#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:05,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {15336#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15337#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:05,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {15337#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15338#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:05,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {15338#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15339#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:05,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {15339#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15340#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:05,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {15340#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15341#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:05,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {15341#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15342#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:05,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {15342#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15343#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:05,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {15343#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15344#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:05,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {15344#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15345#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:05,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {15345#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15346#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:05,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {15346#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15347#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:05,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {15347#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15348#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:05,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {15348#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15349#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:05,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15350#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:05,833 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15351#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:05,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {15351#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15352#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:05,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {15352#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15353#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:05,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {15353#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15354#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:05,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {15354#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15355#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:05,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {15355#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15356#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:05,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {15356#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15357#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:05,839 INFO L273 TraceCheckUtils]: 45: Hoare triple {15357#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15358#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:05,840 INFO L273 TraceCheckUtils]: 46: Hoare triple {15358#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15359#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:05,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {15359#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15360#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:05,842 INFO L273 TraceCheckUtils]: 48: Hoare triple {15360#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15361#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:05,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {15361#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15362#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:05,844 INFO L273 TraceCheckUtils]: 50: Hoare triple {15362#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15363#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:05,845 INFO L273 TraceCheckUtils]: 51: Hoare triple {15363#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15364#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:05,846 INFO L273 TraceCheckUtils]: 52: Hoare triple {15364#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15365#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:05,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {15365#(<= main_~i~0 47)} assume !(~i~0 < 100000); {15317#false} is VALID [2018-11-23 12:11:05,847 INFO L273 TraceCheckUtils]: 54: Hoare triple {15317#false} ~i~0 := 1; {15317#false} is VALID [2018-11-23 12:11:05,847 INFO L273 TraceCheckUtils]: 55: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,847 INFO L273 TraceCheckUtils]: 56: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,848 INFO L273 TraceCheckUtils]: 62: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,849 INFO L273 TraceCheckUtils]: 63: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,849 INFO L273 TraceCheckUtils]: 64: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,849 INFO L273 TraceCheckUtils]: 65: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15317#false} is VALID [2018-11-23 12:11:05,849 INFO L273 TraceCheckUtils]: 66: Hoare triple {15317#false} assume !(~i~0 < 100000); {15317#false} is VALID [2018-11-23 12:11:05,849 INFO L273 TraceCheckUtils]: 67: Hoare triple {15317#false} ~i~0 := 1;~j~0 := 0; {15317#false} is VALID [2018-11-23 12:11:05,849 INFO L273 TraceCheckUtils]: 68: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {15317#false} is VALID [2018-11-23 12:11:05,850 INFO L256 TraceCheckUtils]: 69: Hoare triple {15317#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15317#false} is VALID [2018-11-23 12:11:05,850 INFO L273 TraceCheckUtils]: 70: Hoare triple {15317#false} ~cond := #in~cond; {15317#false} is VALID [2018-11-23 12:11:05,850 INFO L273 TraceCheckUtils]: 71: Hoare triple {15317#false} assume 0 == ~cond; {15317#false} is VALID [2018-11-23 12:11:05,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2018-11-23 12:11:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 12:11:05,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:05,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:05,867 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:11:32,723 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:11:32,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:32,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:32,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {15316#true} call ULTIMATE.init(); {15316#true} is VALID [2018-11-23 12:11:32,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {15316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15316#true} is VALID [2018-11-23 12:11:32,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {15316#true} assume true; {15316#true} is VALID [2018-11-23 12:11:32,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15316#true} {15316#true} #60#return; {15316#true} is VALID [2018-11-23 12:11:32,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {15316#true} call #t~ret4 := main(); {15316#true} is VALID [2018-11-23 12:11:32,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {15316#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {15316#true} is VALID [2018-11-23 12:11:32,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,934 INFO L273 TraceCheckUtils]: 18: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 22: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,936 INFO L273 TraceCheckUtils]: 29: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,937 INFO L273 TraceCheckUtils]: 32: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,937 INFO L273 TraceCheckUtils]: 34: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 38: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,938 INFO L273 TraceCheckUtils]: 44: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,939 INFO L273 TraceCheckUtils]: 46: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,939 INFO L273 TraceCheckUtils]: 49: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,939 INFO L273 TraceCheckUtils]: 50: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,940 INFO L273 TraceCheckUtils]: 52: Hoare triple {15316#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {15316#true} is VALID [2018-11-23 12:11:32,940 INFO L273 TraceCheckUtils]: 53: Hoare triple {15316#true} assume !(~i~0 < 100000); {15316#true} is VALID [2018-11-23 12:11:32,958 INFO L273 TraceCheckUtils]: 54: Hoare triple {15316#true} ~i~0 := 1; {15319#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:32,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {15319#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15324#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:32,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {15324#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15329#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:32,970 INFO L273 TraceCheckUtils]: 57: Hoare triple {15329#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15334#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:32,970 INFO L273 TraceCheckUtils]: 58: Hoare triple {15334#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15339#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:32,971 INFO L273 TraceCheckUtils]: 59: Hoare triple {15339#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15344#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:32,972 INFO L273 TraceCheckUtils]: 60: Hoare triple {15344#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15349#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:32,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {15349#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15354#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:32,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {15354#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15359#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:32,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {15359#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15364#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:32,975 INFO L273 TraceCheckUtils]: 64: Hoare triple {15364#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15561#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:32,975 INFO L273 TraceCheckUtils]: 65: Hoare triple {15561#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {15565#(<= main_~i~0 56)} is VALID [2018-11-23 12:11:32,976 INFO L273 TraceCheckUtils]: 66: Hoare triple {15565#(<= main_~i~0 56)} assume !(~i~0 < 100000); {15317#false} is VALID [2018-11-23 12:11:32,976 INFO L273 TraceCheckUtils]: 67: Hoare triple {15317#false} ~i~0 := 1;~j~0 := 0; {15317#false} is VALID [2018-11-23 12:11:32,977 INFO L273 TraceCheckUtils]: 68: Hoare triple {15317#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {15317#false} is VALID [2018-11-23 12:11:32,977 INFO L256 TraceCheckUtils]: 69: Hoare triple {15317#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15317#false} is VALID [2018-11-23 12:11:32,977 INFO L273 TraceCheckUtils]: 70: Hoare triple {15317#false} ~cond := #in~cond; {15317#false} is VALID [2018-11-23 12:11:32,977 INFO L273 TraceCheckUtils]: 71: Hoare triple {15317#false} assume 0 == ~cond; {15317#false} is VALID [2018-11-23 12:11:32,977 INFO L273 TraceCheckUtils]: 72: Hoare triple {15317#false} assume !false; {15317#false} is VALID [2018-11-23 12:11:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-23 12:11:33,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:33,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 14] total 52 [2018-11-23 12:11:33,005 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 73 [2018-11-23 12:11:33,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:33,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:11:33,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:33,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:11:33,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:11:33,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:11:33,074 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 52 states. [2018-11-23 12:11:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:34,518 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2018-11-23 12:11:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:11:34,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 73 [2018-11-23 12:11:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:11:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 148 transitions. [2018-11-23 12:11:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:11:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 148 transitions. [2018-11-23 12:11:34,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 148 transitions. [2018-11-23 12:11:34,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:34,662 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:11:34,663 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:11:34,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:11:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:11:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2018-11-23 12:11:34,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:34,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 81 states. [2018-11-23 12:11:34,725 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 81 states. [2018-11-23 12:11:34,725 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 81 states. [2018-11-23 12:11:34,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:34,728 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2018-11-23 12:11:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-11-23 12:11:34,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:34,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:34,729 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 117 states. [2018-11-23 12:11:34,729 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 117 states. [2018-11-23 12:11:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:34,731 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2018-11-23 12:11:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-11-23 12:11:34,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:34,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:34,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:34,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:11:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-11-23 12:11:34,733 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 73 [2018-11-23 12:11:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:34,734 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-23 12:11:34,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:11:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 12:11:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:11:34,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:34,734 INFO L402 BasicCegarLoop]: trace histogram [50, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:34,735 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:34,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1245443686, now seen corresponding path program 31 times [2018-11-23 12:11:34,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:34,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:34,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:36,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {16222#true} call ULTIMATE.init(); {16222#true} is VALID [2018-11-23 12:11:36,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {16222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16222#true} is VALID [2018-11-23 12:11:36,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {16222#true} assume true; {16222#true} is VALID [2018-11-23 12:11:36,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16222#true} {16222#true} #60#return; {16222#true} is VALID [2018-11-23 12:11:36,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {16222#true} call #t~ret4 := main(); {16222#true} is VALID [2018-11-23 12:11:36,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {16222#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {16224#(= main_~i~0 0)} is VALID [2018-11-23 12:11:36,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {16224#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16225#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:36,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {16225#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16226#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:36,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {16226#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16227#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:36,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {16227#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16228#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:36,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {16228#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16229#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:36,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {16229#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16230#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:36,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {16230#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16231#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:36,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {16231#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16232#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:36,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {16232#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16233#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:36,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {16233#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16234#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:36,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {16234#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16235#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:36,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {16235#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16236#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:36,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {16236#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16237#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:36,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {16237#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16238#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:36,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {16238#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16239#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:36,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {16239#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16240#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:36,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {16240#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16241#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:36,311 INFO L273 TraceCheckUtils]: 23: Hoare triple {16241#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16242#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:36,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {16242#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16243#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:36,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {16243#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16244#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:36,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {16244#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16245#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:36,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {16245#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16246#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:36,317 INFO L273 TraceCheckUtils]: 28: Hoare triple {16246#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16247#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:36,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {16247#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16248#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:36,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {16248#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16249#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:36,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {16249#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16250#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:36,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {16250#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16251#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:36,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {16251#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16252#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:36,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {16252#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16253#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:36,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {16253#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16254#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:36,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {16254#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16255#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:36,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {16255#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16256#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:36,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {16256#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16257#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:36,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {16257#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16258#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:36,328 INFO L273 TraceCheckUtils]: 40: Hoare triple {16258#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16259#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:36,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {16259#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16260#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:36,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {16260#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16261#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:36,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {16261#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16262#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:36,332 INFO L273 TraceCheckUtils]: 44: Hoare triple {16262#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16263#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:36,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {16263#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16264#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:36,334 INFO L273 TraceCheckUtils]: 46: Hoare triple {16264#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16265#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:36,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {16265#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16266#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:36,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {16266#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16267#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:36,337 INFO L273 TraceCheckUtils]: 49: Hoare triple {16267#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16268#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:36,338 INFO L273 TraceCheckUtils]: 50: Hoare triple {16268#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16269#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:36,339 INFO L273 TraceCheckUtils]: 51: Hoare triple {16269#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16270#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:36,340 INFO L273 TraceCheckUtils]: 52: Hoare triple {16270#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16271#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:36,341 INFO L273 TraceCheckUtils]: 53: Hoare triple {16271#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16272#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:36,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {16272#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16273#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:36,343 INFO L273 TraceCheckUtils]: 55: Hoare triple {16273#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16274#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:36,347 INFO L273 TraceCheckUtils]: 56: Hoare triple {16274#(<= main_~i~0 50)} assume !(~i~0 < 100000); {16223#false} is VALID [2018-11-23 12:11:36,347 INFO L273 TraceCheckUtils]: 57: Hoare triple {16223#false} ~i~0 := 1; {16223#false} is VALID [2018-11-23 12:11:36,347 INFO L273 TraceCheckUtils]: 58: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,347 INFO L273 TraceCheckUtils]: 59: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,348 INFO L273 TraceCheckUtils]: 60: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,348 INFO L273 TraceCheckUtils]: 61: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,348 INFO L273 TraceCheckUtils]: 62: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,348 INFO L273 TraceCheckUtils]: 63: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,349 INFO L273 TraceCheckUtils]: 66: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,349 INFO L273 TraceCheckUtils]: 67: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,349 INFO L273 TraceCheckUtils]: 70: Hoare triple {16223#false} assume !(~i~0 < 100000); {16223#false} is VALID [2018-11-23 12:11:36,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {16223#false} ~i~0 := 1;~j~0 := 0; {16223#false} is VALID [2018-11-23 12:11:36,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {16223#false} is VALID [2018-11-23 12:11:36,350 INFO L256 TraceCheckUtils]: 73: Hoare triple {16223#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16223#false} is VALID [2018-11-23 12:11:36,350 INFO L273 TraceCheckUtils]: 74: Hoare triple {16223#false} ~cond := #in~cond; {16223#false} is VALID [2018-11-23 12:11:36,350 INFO L273 TraceCheckUtils]: 75: Hoare triple {16223#false} assume 0 == ~cond; {16223#false} is VALID [2018-11-23 12:11:36,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {16223#false} assume !false; {16223#false} is VALID [2018-11-23 12:11:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:11:36,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:36,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:36,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:36,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:36,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {16222#true} call ULTIMATE.init(); {16222#true} is VALID [2018-11-23 12:11:36,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {16222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16222#true} is VALID [2018-11-23 12:11:36,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {16222#true} assume true; {16222#true} is VALID [2018-11-23 12:11:36,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16222#true} {16222#true} #60#return; {16222#true} is VALID [2018-11-23 12:11:36,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {16222#true} call #t~ret4 := main(); {16222#true} is VALID [2018-11-23 12:11:36,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {16222#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {16293#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:36,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {16293#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16225#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:36,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {16225#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16226#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:36,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {16226#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16227#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:36,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {16227#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16228#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:36,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {16228#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16229#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:36,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {16229#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16230#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:36,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {16230#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16231#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:36,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {16231#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16232#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:36,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {16232#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16233#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:36,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {16233#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16234#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:36,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {16234#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16235#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:36,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {16235#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16236#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:36,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {16236#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16237#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:36,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {16237#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16238#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:36,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {16238#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16239#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:36,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {16239#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16240#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:36,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {16240#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16241#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:36,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {16241#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16242#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:36,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {16242#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16243#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:36,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {16243#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16244#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:36,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {16244#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16245#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:36,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {16245#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16246#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:36,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {16246#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16247#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:36,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {16247#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16248#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:36,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {16248#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16249#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:36,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {16249#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16250#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:36,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {16250#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16251#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:36,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {16251#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16252#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:36,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {16252#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16253#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:36,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {16253#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16254#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:36,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {16254#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16255#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:36,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {16255#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16256#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:36,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {16256#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16257#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:36,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {16257#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16258#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:36,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {16258#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16259#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:36,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {16259#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16260#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:36,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {16260#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16261#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:36,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {16261#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16262#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:36,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {16262#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16263#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:36,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {16263#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16264#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:36,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {16264#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16265#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:36,811 INFO L273 TraceCheckUtils]: 47: Hoare triple {16265#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16266#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:36,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {16266#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16267#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:36,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {16267#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16268#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:36,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {16268#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16269#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:36,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {16269#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16270#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:36,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {16270#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16271#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:36,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {16271#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16272#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:36,819 INFO L273 TraceCheckUtils]: 54: Hoare triple {16272#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16273#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:36,820 INFO L273 TraceCheckUtils]: 55: Hoare triple {16273#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {16274#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:36,820 INFO L273 TraceCheckUtils]: 56: Hoare triple {16274#(<= main_~i~0 50)} assume !(~i~0 < 100000); {16223#false} is VALID [2018-11-23 12:11:36,820 INFO L273 TraceCheckUtils]: 57: Hoare triple {16223#false} ~i~0 := 1; {16223#false} is VALID [2018-11-23 12:11:36,821 INFO L273 TraceCheckUtils]: 58: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,821 INFO L273 TraceCheckUtils]: 60: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,821 INFO L273 TraceCheckUtils]: 61: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,821 INFO L273 TraceCheckUtils]: 62: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,822 INFO L273 TraceCheckUtils]: 64: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,822 INFO L273 TraceCheckUtils]: 65: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,822 INFO L273 TraceCheckUtils]: 66: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,822 INFO L273 TraceCheckUtils]: 67: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,823 INFO L273 TraceCheckUtils]: 68: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,823 INFO L273 TraceCheckUtils]: 69: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {16223#false} is VALID [2018-11-23 12:11:36,823 INFO L273 TraceCheckUtils]: 70: Hoare triple {16223#false} assume !(~i~0 < 100000); {16223#false} is VALID [2018-11-23 12:11:36,823 INFO L273 TraceCheckUtils]: 71: Hoare triple {16223#false} ~i~0 := 1;~j~0 := 0; {16223#false} is VALID [2018-11-23 12:11:36,823 INFO L273 TraceCheckUtils]: 72: Hoare triple {16223#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {16223#false} is VALID [2018-11-23 12:11:36,823 INFO L256 TraceCheckUtils]: 73: Hoare triple {16223#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16223#false} is VALID [2018-11-23 12:11:36,824 INFO L273 TraceCheckUtils]: 74: Hoare triple {16223#false} ~cond := #in~cond; {16223#false} is VALID [2018-11-23 12:11:36,824 INFO L273 TraceCheckUtils]: 75: Hoare triple {16223#false} assume 0 == ~cond; {16223#false} is VALID [2018-11-23 12:11:36,824 INFO L273 TraceCheckUtils]: 76: Hoare triple {16223#false} assume !false; {16223#false} is VALID [2018-11-23 12:11:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:11:36,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:36,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-23 12:11:36,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 77 [2018-11-23 12:11:36,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:36,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:11:36,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:36,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:11:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:11:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:11:36,901 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 54 states. [2018-11-23 12:11:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:38,657 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 12:11:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 12:11:38,657 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 77 [2018-11-23 12:11:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:11:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 136 transitions. [2018-11-23 12:11:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:11:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 136 transitions. [2018-11-23 12:11:38,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 136 transitions. [2018-11-23 12:11:38,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:38,829 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:11:38,829 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 12:11:38,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:11:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 12:11:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 82. [2018-11-23 12:11:38,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:38,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 82 states. [2018-11-23 12:11:38,886 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 82 states. [2018-11-23 12:11:38,886 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 82 states. [2018-11-23 12:11:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:38,888 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-23 12:11:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-11-23 12:11:38,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:38,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:38,889 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 112 states. [2018-11-23 12:11:38,889 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 112 states. [2018-11-23 12:11:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:38,891 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-11-23 12:11:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-11-23 12:11:38,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:38,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:38,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:38,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 12:11:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-23 12:11:38,893 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 77 [2018-11-23 12:11:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:38,894 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-23 12:11:38,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:11:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 12:11:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:11:38,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:38,895 INFO L402 BasicCegarLoop]: trace histogram [51, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:38,895 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:38,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 466355082, now seen corresponding path program 32 times [2018-11-23 12:11:38,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:38,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:40,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {17128#true} call ULTIMATE.init(); {17128#true} is VALID [2018-11-23 12:11:40,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {17128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17128#true} is VALID [2018-11-23 12:11:40,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {17128#true} assume true; {17128#true} is VALID [2018-11-23 12:11:40,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17128#true} {17128#true} #60#return; {17128#true} is VALID [2018-11-23 12:11:40,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {17128#true} call #t~ret4 := main(); {17128#true} is VALID [2018-11-23 12:11:40,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {17128#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {17130#(= main_~i~0 0)} is VALID [2018-11-23 12:11:40,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {17130#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17131#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:40,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {17131#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17132#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:40,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {17132#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17133#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:40,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {17133#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17134#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:40,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {17134#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17135#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:40,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {17135#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17136#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:40,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {17136#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17137#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:40,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {17137#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17138#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:40,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {17138#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17139#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:40,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {17139#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17140#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:40,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {17140#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17141#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:40,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {17141#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17142#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:40,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {17142#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17143#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:40,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {17143#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17144#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:40,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {17144#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17145#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:40,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {17145#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17146#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:40,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {17146#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17147#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:40,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {17147#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17148#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:40,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {17148#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17149#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:40,336 INFO L273 TraceCheckUtils]: 25: Hoare triple {17149#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17150#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:40,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {17150#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17151#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:40,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {17151#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17152#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:40,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {17152#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17153#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:40,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {17153#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17154#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:40,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {17154#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17155#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:40,341 INFO L273 TraceCheckUtils]: 31: Hoare triple {17155#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17156#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:40,342 INFO L273 TraceCheckUtils]: 32: Hoare triple {17156#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17157#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:40,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {17157#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17158#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:40,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {17158#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17159#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:40,345 INFO L273 TraceCheckUtils]: 35: Hoare triple {17159#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17160#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:40,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {17160#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17161#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:40,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {17161#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17162#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:40,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {17162#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17163#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:40,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {17163#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17164#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:40,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {17164#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17165#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:40,351 INFO L273 TraceCheckUtils]: 41: Hoare triple {17165#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17166#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:40,352 INFO L273 TraceCheckUtils]: 42: Hoare triple {17166#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17167#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:40,353 INFO L273 TraceCheckUtils]: 43: Hoare triple {17167#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17168#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:40,354 INFO L273 TraceCheckUtils]: 44: Hoare triple {17168#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17169#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:40,355 INFO L273 TraceCheckUtils]: 45: Hoare triple {17169#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17170#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:40,356 INFO L273 TraceCheckUtils]: 46: Hoare triple {17170#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17171#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:40,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {17171#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17172#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:40,358 INFO L273 TraceCheckUtils]: 48: Hoare triple {17172#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17173#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:40,359 INFO L273 TraceCheckUtils]: 49: Hoare triple {17173#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17174#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:40,360 INFO L273 TraceCheckUtils]: 50: Hoare triple {17174#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17175#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:40,361 INFO L273 TraceCheckUtils]: 51: Hoare triple {17175#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17176#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:40,362 INFO L273 TraceCheckUtils]: 52: Hoare triple {17176#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17177#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:40,363 INFO L273 TraceCheckUtils]: 53: Hoare triple {17177#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17178#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:40,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {17178#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17179#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:40,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {17179#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17180#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:40,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {17180#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17181#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {17181#(<= main_~i~0 51)} assume !(~i~0 < 100000); {17129#false} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 58: Hoare triple {17129#false} ~i~0 := 1; {17129#false} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 59: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 60: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 61: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 62: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 63: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 64: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 65: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 66: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 67: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 68: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 69: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 70: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 71: Hoare triple {17129#false} assume !(~i~0 < 100000); {17129#false} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 72: Hoare triple {17129#false} ~i~0 := 1;~j~0 := 0; {17129#false} is VALID [2018-11-23 12:11:40,370 INFO L273 TraceCheckUtils]: 73: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {17129#false} is VALID [2018-11-23 12:11:40,370 INFO L256 TraceCheckUtils]: 74: Hoare triple {17129#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17129#false} is VALID [2018-11-23 12:11:40,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {17129#false} ~cond := #in~cond; {17129#false} is VALID [2018-11-23 12:11:40,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {17129#false} assume 0 == ~cond; {17129#false} is VALID [2018-11-23 12:11:40,370 INFO L273 TraceCheckUtils]: 77: Hoare triple {17129#false} assume !false; {17129#false} is VALID [2018-11-23 12:11:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:11:40,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:40,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:40,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:11:40,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:11:40,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:40,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:40,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {17128#true} call ULTIMATE.init(); {17128#true} is VALID [2018-11-23 12:11:40,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {17128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17128#true} is VALID [2018-11-23 12:11:40,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {17128#true} assume true; {17128#true} is VALID [2018-11-23 12:11:40,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17128#true} {17128#true} #60#return; {17128#true} is VALID [2018-11-23 12:11:40,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {17128#true} call #t~ret4 := main(); {17128#true} is VALID [2018-11-23 12:11:40,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {17128#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {17200#(<= main_~i~0 0)} is VALID [2018-11-23 12:11:40,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {17200#(<= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17131#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:40,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {17131#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17132#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:40,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {17132#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17133#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:40,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {17133#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17134#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:40,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {17134#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17135#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:40,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {17135#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17136#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:40,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {17136#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17137#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:40,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {17137#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17138#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:40,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {17138#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17139#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:40,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {17139#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17140#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:40,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {17140#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17141#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:40,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {17141#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17142#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:40,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {17142#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17143#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:40,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {17143#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17144#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:41,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {17144#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17145#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:41,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {17145#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17146#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:41,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {17146#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17147#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:41,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {17147#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17148#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:41,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {17148#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17149#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:41,012 INFO L273 TraceCheckUtils]: 25: Hoare triple {17149#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17150#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:41,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {17150#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17151#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:41,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {17151#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17152#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:41,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {17152#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17153#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:41,015 INFO L273 TraceCheckUtils]: 29: Hoare triple {17153#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17154#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:41,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {17154#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17155#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:41,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {17155#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17156#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:41,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {17156#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17157#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:41,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {17157#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17158#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:41,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {17158#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17159#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:41,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {17159#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17160#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:41,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {17160#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17161#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:41,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {17161#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17162#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:41,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {17162#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17163#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:41,025 INFO L273 TraceCheckUtils]: 39: Hoare triple {17163#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17164#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:41,026 INFO L273 TraceCheckUtils]: 40: Hoare triple {17164#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17165#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:41,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {17165#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17166#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:41,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {17166#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17167#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:41,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {17167#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17168#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:41,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {17168#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17169#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:41,031 INFO L273 TraceCheckUtils]: 45: Hoare triple {17169#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17170#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:41,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {17170#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17171#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:41,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {17171#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17172#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:41,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {17172#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17173#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:41,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {17173#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17174#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:41,036 INFO L273 TraceCheckUtils]: 50: Hoare triple {17174#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17175#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:41,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {17175#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17176#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:41,038 INFO L273 TraceCheckUtils]: 52: Hoare triple {17176#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17177#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:41,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {17177#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17178#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:41,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {17178#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17179#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:41,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {17179#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17180#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:41,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {17180#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {17181#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:41,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {17181#(<= main_~i~0 51)} assume !(~i~0 < 100000); {17129#false} is VALID [2018-11-23 12:11:41,043 INFO L273 TraceCheckUtils]: 58: Hoare triple {17129#false} ~i~0 := 1; {17129#false} is VALID [2018-11-23 12:11:41,043 INFO L273 TraceCheckUtils]: 59: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,044 INFO L273 TraceCheckUtils]: 61: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,044 INFO L273 TraceCheckUtils]: 62: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,044 INFO L273 TraceCheckUtils]: 63: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,044 INFO L273 TraceCheckUtils]: 64: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,045 INFO L273 TraceCheckUtils]: 65: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,045 INFO L273 TraceCheckUtils]: 66: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,045 INFO L273 TraceCheckUtils]: 67: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,045 INFO L273 TraceCheckUtils]: 68: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,045 INFO L273 TraceCheckUtils]: 69: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 70: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 71: Hoare triple {17129#false} assume !(~i~0 < 100000); {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 72: Hoare triple {17129#false} ~i~0 := 1;~j~0 := 0; {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 73: Hoare triple {17129#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L256 TraceCheckUtils]: 74: Hoare triple {17129#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 75: Hoare triple {17129#false} ~cond := #in~cond; {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 76: Hoare triple {17129#false} assume 0 == ~cond; {17129#false} is VALID [2018-11-23 12:11:41,046 INFO L273 TraceCheckUtils]: 77: Hoare triple {17129#false} assume !false; {17129#false} is VALID [2018-11-23 12:11:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:11:41,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:41,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-23 12:11:41,071 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 78 [2018-11-23 12:11:41,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:41,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:11:41,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:41,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:11:41,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:11:41,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:11:41,121 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 55 states. [2018-11-23 12:11:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:42,557 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-11-23 12:11:42,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:11:42,558 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 78 [2018-11-23 12:11:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:11:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 142 transitions. [2018-11-23 12:11:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:11:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 142 transitions. [2018-11-23 12:11:42,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 142 transitions. [2018-11-23 12:11:42,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:42,699 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:11:42,700 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 12:11:42,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:11:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 12:11:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 83. [2018-11-23 12:11:42,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:42,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 83 states. [2018-11-23 12:11:42,809 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 83 states. [2018-11-23 12:11:42,809 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 83 states. [2018-11-23 12:11:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:42,812 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-11-23 12:11:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-11-23 12:11:42,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:42,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:42,813 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 116 states. [2018-11-23 12:11:42,813 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 116 states. [2018-11-23 12:11:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:42,815 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-11-23 12:11:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-11-23 12:11:42,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:42,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:42,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:42,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:11:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-23 12:11:42,817 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 78 [2018-11-23 12:11:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:42,818 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-23 12:11:42,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:11:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 12:11:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:11:42,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:42,819 INFO L402 BasicCegarLoop]: trace histogram [52, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:42,819 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:42,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2084412134, now seen corresponding path program 33 times [2018-11-23 12:11:42,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:42,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:44,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {18055#true} call ULTIMATE.init(); {18055#true} is VALID [2018-11-23 12:11:44,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {18055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18055#true} is VALID [2018-11-23 12:11:44,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {18055#true} assume true; {18055#true} is VALID [2018-11-23 12:11:44,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18055#true} {18055#true} #60#return; {18055#true} is VALID [2018-11-23 12:11:44,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {18055#true} call #t~ret4 := main(); {18055#true} is VALID [2018-11-23 12:11:44,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {18055#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {18057#(= main_~i~0 0)} is VALID [2018-11-23 12:11:44,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {18057#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18058#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:44,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {18058#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18059#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:44,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {18059#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18060#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:44,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {18060#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18061#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:44,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {18061#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18062#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:44,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {18062#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18063#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:44,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {18063#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18064#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:44,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {18064#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18065#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:44,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {18065#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18066#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:44,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {18066#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18067#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:44,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {18067#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18068#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:44,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {18068#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18069#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:44,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {18069#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18070#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:44,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {18070#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18071#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:44,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {18071#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18072#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:44,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {18072#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18073#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:44,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {18073#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18074#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:44,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {18074#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18075#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:44,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {18075#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18076#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:44,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {18076#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18077#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:44,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {18077#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18078#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:44,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {18078#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18079#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:44,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {18079#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18080#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:44,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {18080#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18081#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:44,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {18081#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18082#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:44,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {18082#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18083#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:44,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {18083#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18084#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:44,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {18084#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18085#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:44,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {18085#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18086#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:44,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {18086#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18087#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:44,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {18087#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18088#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:44,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {18088#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18089#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:44,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {18089#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18090#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:44,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {18090#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18091#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:44,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {18091#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18092#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:44,491 INFO L273 TraceCheckUtils]: 41: Hoare triple {18092#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18093#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:44,492 INFO L273 TraceCheckUtils]: 42: Hoare triple {18093#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18094#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:44,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {18094#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18095#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:44,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {18095#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18096#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:44,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {18096#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18097#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:44,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {18097#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18098#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:44,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {18098#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18099#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:44,498 INFO L273 TraceCheckUtils]: 48: Hoare triple {18099#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18100#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:44,499 INFO L273 TraceCheckUtils]: 49: Hoare triple {18100#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18101#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:44,500 INFO L273 TraceCheckUtils]: 50: Hoare triple {18101#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18102#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:44,501 INFO L273 TraceCheckUtils]: 51: Hoare triple {18102#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18103#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:44,502 INFO L273 TraceCheckUtils]: 52: Hoare triple {18103#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18104#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:44,503 INFO L273 TraceCheckUtils]: 53: Hoare triple {18104#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18105#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:44,504 INFO L273 TraceCheckUtils]: 54: Hoare triple {18105#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18106#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:44,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {18106#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18107#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:44,506 INFO L273 TraceCheckUtils]: 56: Hoare triple {18107#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18108#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:44,507 INFO L273 TraceCheckUtils]: 57: Hoare triple {18108#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18109#(<= main_~i~0 52)} is VALID [2018-11-23 12:11:44,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {18109#(<= main_~i~0 52)} assume !(~i~0 < 100000); {18056#false} is VALID [2018-11-23 12:11:44,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {18056#false} ~i~0 := 1; {18056#false} is VALID [2018-11-23 12:11:44,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,508 INFO L273 TraceCheckUtils]: 62: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,509 INFO L273 TraceCheckUtils]: 66: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,509 INFO L273 TraceCheckUtils]: 67: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,510 INFO L273 TraceCheckUtils]: 68: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,510 INFO L273 TraceCheckUtils]: 69: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,510 INFO L273 TraceCheckUtils]: 70: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,510 INFO L273 TraceCheckUtils]: 71: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18056#false} is VALID [2018-11-23 12:11:44,510 INFO L273 TraceCheckUtils]: 72: Hoare triple {18056#false} assume !(~i~0 < 100000); {18056#false} is VALID [2018-11-23 12:11:44,511 INFO L273 TraceCheckUtils]: 73: Hoare triple {18056#false} ~i~0 := 1;~j~0 := 0; {18056#false} is VALID [2018-11-23 12:11:44,511 INFO L273 TraceCheckUtils]: 74: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {18056#false} is VALID [2018-11-23 12:11:44,511 INFO L256 TraceCheckUtils]: 75: Hoare triple {18056#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {18056#false} is VALID [2018-11-23 12:11:44,511 INFO L273 TraceCheckUtils]: 76: Hoare triple {18056#false} ~cond := #in~cond; {18056#false} is VALID [2018-11-23 12:11:44,511 INFO L273 TraceCheckUtils]: 77: Hoare triple {18056#false} assume 0 == ~cond; {18056#false} is VALID [2018-11-23 12:11:44,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {18056#false} assume !false; {18056#false} is VALID [2018-11-23 12:11:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-23 12:11:44,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:44,517 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:44,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:11:45,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:11:45,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:46,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:47,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {18055#true} call ULTIMATE.init(); {18055#true} is VALID [2018-11-23 12:11:47,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {18055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18055#true} is VALID [2018-11-23 12:11:47,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {18055#true} assume true; {18055#true} is VALID [2018-11-23 12:11:47,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18055#true} {18055#true} #60#return; {18055#true} is VALID [2018-11-23 12:11:47,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {18055#true} call #t~ret4 := main(); {18055#true} is VALID [2018-11-23 12:11:47,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {18055#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {18055#true} is VALID [2018-11-23 12:11:47,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 39: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 41: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 48: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 49: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,240 INFO L273 TraceCheckUtils]: 54: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,240 INFO L273 TraceCheckUtils]: 56: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {18055#true} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {18055#true} is VALID [2018-11-23 12:11:47,240 INFO L273 TraceCheckUtils]: 58: Hoare triple {18055#true} assume !(~i~0 < 100000); {18055#true} is VALID [2018-11-23 12:11:47,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {18055#true} ~i~0 := 1; {18058#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:47,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {18058#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18063#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:47,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {18063#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18068#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:47,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {18068#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18073#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:47,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {18073#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18078#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:47,244 INFO L273 TraceCheckUtils]: 64: Hoare triple {18078#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18083#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:47,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {18083#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18088#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:47,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {18088#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18093#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:47,247 INFO L273 TraceCheckUtils]: 67: Hoare triple {18093#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18098#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:47,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {18098#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18103#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:47,249 INFO L273 TraceCheckUtils]: 69: Hoare triple {18103#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18108#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:47,250 INFO L273 TraceCheckUtils]: 70: Hoare triple {18108#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18323#(<= main_~i~0 56)} is VALID [2018-11-23 12:11:47,251 INFO L273 TraceCheckUtils]: 71: Hoare triple {18323#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {18327#(<= main_~i~0 61)} is VALID [2018-11-23 12:11:47,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {18327#(<= main_~i~0 61)} assume !(~i~0 < 100000); {18056#false} is VALID [2018-11-23 12:11:47,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {18056#false} ~i~0 := 1;~j~0 := 0; {18056#false} is VALID [2018-11-23 12:11:47,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {18056#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {18056#false} is VALID [2018-11-23 12:11:47,253 INFO L256 TraceCheckUtils]: 75: Hoare triple {18056#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {18056#false} is VALID [2018-11-23 12:11:47,253 INFO L273 TraceCheckUtils]: 76: Hoare triple {18056#false} ~cond := #in~cond; {18056#false} is VALID [2018-11-23 12:11:47,253 INFO L273 TraceCheckUtils]: 77: Hoare triple {18056#false} assume 0 == ~cond; {18056#false} is VALID [2018-11-23 12:11:47,253 INFO L273 TraceCheckUtils]: 78: Hoare triple {18056#false} assume !false; {18056#false} is VALID [2018-11-23 12:11:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-23 12:11:47,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:47,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 15] total 57 [2018-11-23 12:11:47,278 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2018-11-23 12:11:47,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:47,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 12:11:47,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:47,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:11:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:11:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:11:47,355 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 57 states. [2018-11-23 12:11:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:49,492 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-23 12:11:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 12:11:49,493 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2018-11-23 12:11:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:11:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 158 transitions. [2018-11-23 12:11:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:11:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 158 transitions. [2018-11-23 12:11:49,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 158 transitions. [2018-11-23 12:11:49,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:49,663 INFO L225 Difference]: With dead ends: 150 [2018-11-23 12:11:49,664 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:11:49,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:11:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:11:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 87. [2018-11-23 12:11:49,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:49,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 87 states. [2018-11-23 12:11:49,789 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 87 states. [2018-11-23 12:11:49,789 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 87 states. [2018-11-23 12:11:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:49,793 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2018-11-23 12:11:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-11-23 12:11:49,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:49,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:49,793 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 126 states. [2018-11-23 12:11:49,793 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 126 states. [2018-11-23 12:11:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:49,796 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2018-11-23 12:11:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-11-23 12:11:49,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:49,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:49,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:49,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:11:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-11-23 12:11:49,798 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 79 [2018-11-23 12:11:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:49,798 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-11-23 12:11:49,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:11:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-23 12:11:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:11:49,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:49,799 INFO L402 BasicCegarLoop]: trace histogram [55, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:49,799 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:49,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash -281126651, now seen corresponding path program 34 times [2018-11-23 12:11:49,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:49,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:49,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:51,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {19033#true} call ULTIMATE.init(); {19033#true} is VALID [2018-11-23 12:11:51,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {19033#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19033#true} is VALID [2018-11-23 12:11:51,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {19033#true} assume true; {19033#true} is VALID [2018-11-23 12:11:51,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19033#true} {19033#true} #60#return; {19033#true} is VALID [2018-11-23 12:11:51,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {19033#true} call #t~ret4 := main(); {19033#true} is VALID [2018-11-23 12:11:51,818 INFO L273 TraceCheckUtils]: 5: Hoare triple {19033#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0;~j~0 := 0; {19035#(= main_~i~0 0)} is VALID [2018-11-23 12:11:51,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {19035#(= main_~i~0 0)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19036#(<= main_~i~0 1)} is VALID [2018-11-23 12:11:51,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {19036#(<= main_~i~0 1)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19037#(<= main_~i~0 2)} is VALID [2018-11-23 12:11:51,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {19037#(<= main_~i~0 2)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19038#(<= main_~i~0 3)} is VALID [2018-11-23 12:11:51,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {19038#(<= main_~i~0 3)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19039#(<= main_~i~0 4)} is VALID [2018-11-23 12:11:51,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {19039#(<= main_~i~0 4)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19040#(<= main_~i~0 5)} is VALID [2018-11-23 12:11:51,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {19040#(<= main_~i~0 5)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19041#(<= main_~i~0 6)} is VALID [2018-11-23 12:11:51,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {19041#(<= main_~i~0 6)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19042#(<= main_~i~0 7)} is VALID [2018-11-23 12:11:51,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {19042#(<= main_~i~0 7)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19043#(<= main_~i~0 8)} is VALID [2018-11-23 12:11:51,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {19043#(<= main_~i~0 8)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19044#(<= main_~i~0 9)} is VALID [2018-11-23 12:11:51,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {19044#(<= main_~i~0 9)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19045#(<= main_~i~0 10)} is VALID [2018-11-23 12:11:51,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {19045#(<= main_~i~0 10)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19046#(<= main_~i~0 11)} is VALID [2018-11-23 12:11:51,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {19046#(<= main_~i~0 11)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19047#(<= main_~i~0 12)} is VALID [2018-11-23 12:11:51,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {19047#(<= main_~i~0 12)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19048#(<= main_~i~0 13)} is VALID [2018-11-23 12:11:51,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {19048#(<= main_~i~0 13)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19049#(<= main_~i~0 14)} is VALID [2018-11-23 12:11:51,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {19049#(<= main_~i~0 14)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19050#(<= main_~i~0 15)} is VALID [2018-11-23 12:11:51,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {19050#(<= main_~i~0 15)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19051#(<= main_~i~0 16)} is VALID [2018-11-23 12:11:51,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {19051#(<= main_~i~0 16)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19052#(<= main_~i~0 17)} is VALID [2018-11-23 12:11:51,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {19052#(<= main_~i~0 17)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19053#(<= main_~i~0 18)} is VALID [2018-11-23 12:11:51,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {19053#(<= main_~i~0 18)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19054#(<= main_~i~0 19)} is VALID [2018-11-23 12:11:51,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {19054#(<= main_~i~0 19)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19055#(<= main_~i~0 20)} is VALID [2018-11-23 12:11:51,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {19055#(<= main_~i~0 20)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19056#(<= main_~i~0 21)} is VALID [2018-11-23 12:11:51,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {19056#(<= main_~i~0 21)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19057#(<= main_~i~0 22)} is VALID [2018-11-23 12:11:51,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {19057#(<= main_~i~0 22)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19058#(<= main_~i~0 23)} is VALID [2018-11-23 12:11:51,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {19058#(<= main_~i~0 23)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19059#(<= main_~i~0 24)} is VALID [2018-11-23 12:11:51,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {19059#(<= main_~i~0 24)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19060#(<= main_~i~0 25)} is VALID [2018-11-23 12:11:51,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {19060#(<= main_~i~0 25)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19061#(<= main_~i~0 26)} is VALID [2018-11-23 12:11:51,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {19061#(<= main_~i~0 26)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19062#(<= main_~i~0 27)} is VALID [2018-11-23 12:11:51,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {19062#(<= main_~i~0 27)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19063#(<= main_~i~0 28)} is VALID [2018-11-23 12:11:51,847 INFO L273 TraceCheckUtils]: 34: Hoare triple {19063#(<= main_~i~0 28)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19064#(<= main_~i~0 29)} is VALID [2018-11-23 12:11:51,848 INFO L273 TraceCheckUtils]: 35: Hoare triple {19064#(<= main_~i~0 29)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19065#(<= main_~i~0 30)} is VALID [2018-11-23 12:11:51,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {19065#(<= main_~i~0 30)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19066#(<= main_~i~0 31)} is VALID [2018-11-23 12:11:51,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {19066#(<= main_~i~0 31)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19067#(<= main_~i~0 32)} is VALID [2018-11-23 12:11:51,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {19067#(<= main_~i~0 32)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19068#(<= main_~i~0 33)} is VALID [2018-11-23 12:11:51,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {19068#(<= main_~i~0 33)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19069#(<= main_~i~0 34)} is VALID [2018-11-23 12:11:51,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {19069#(<= main_~i~0 34)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19070#(<= main_~i~0 35)} is VALID [2018-11-23 12:11:51,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {19070#(<= main_~i~0 35)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19071#(<= main_~i~0 36)} is VALID [2018-11-23 12:11:51,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {19071#(<= main_~i~0 36)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19072#(<= main_~i~0 37)} is VALID [2018-11-23 12:11:51,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {19072#(<= main_~i~0 37)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19073#(<= main_~i~0 38)} is VALID [2018-11-23 12:11:51,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {19073#(<= main_~i~0 38)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19074#(<= main_~i~0 39)} is VALID [2018-11-23 12:11:51,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {19074#(<= main_~i~0 39)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19075#(<= main_~i~0 40)} is VALID [2018-11-23 12:11:51,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {19075#(<= main_~i~0 40)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19076#(<= main_~i~0 41)} is VALID [2018-11-23 12:11:51,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {19076#(<= main_~i~0 41)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19077#(<= main_~i~0 42)} is VALID [2018-11-23 12:11:51,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {19077#(<= main_~i~0 42)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19078#(<= main_~i~0 43)} is VALID [2018-11-23 12:11:51,862 INFO L273 TraceCheckUtils]: 49: Hoare triple {19078#(<= main_~i~0 43)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19079#(<= main_~i~0 44)} is VALID [2018-11-23 12:11:51,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {19079#(<= main_~i~0 44)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19080#(<= main_~i~0 45)} is VALID [2018-11-23 12:11:51,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {19080#(<= main_~i~0 45)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19081#(<= main_~i~0 46)} is VALID [2018-11-23 12:11:51,865 INFO L273 TraceCheckUtils]: 52: Hoare triple {19081#(<= main_~i~0 46)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19082#(<= main_~i~0 47)} is VALID [2018-11-23 12:11:51,866 INFO L273 TraceCheckUtils]: 53: Hoare triple {19082#(<= main_~i~0 47)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19083#(<= main_~i~0 48)} is VALID [2018-11-23 12:11:51,867 INFO L273 TraceCheckUtils]: 54: Hoare triple {19083#(<= main_~i~0 48)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19084#(<= main_~i~0 49)} is VALID [2018-11-23 12:11:51,868 INFO L273 TraceCheckUtils]: 55: Hoare triple {19084#(<= main_~i~0 49)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19085#(<= main_~i~0 50)} is VALID [2018-11-23 12:11:51,869 INFO L273 TraceCheckUtils]: 56: Hoare triple {19085#(<= main_~i~0 50)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19086#(<= main_~i~0 51)} is VALID [2018-11-23 12:11:51,870 INFO L273 TraceCheckUtils]: 57: Hoare triple {19086#(<= main_~i~0 51)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19087#(<= main_~i~0 52)} is VALID [2018-11-23 12:11:51,871 INFO L273 TraceCheckUtils]: 58: Hoare triple {19087#(<= main_~i~0 52)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19088#(<= main_~i~0 53)} is VALID [2018-11-23 12:11:51,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {19088#(<= main_~i~0 53)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19089#(<= main_~i~0 54)} is VALID [2018-11-23 12:11:51,873 INFO L273 TraceCheckUtils]: 60: Hoare triple {19089#(<= main_~i~0 54)} assume !!(~i~0 < 100000);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);havoc #t~nondet0;~i~0 := 1 + ~i~0; {19090#(<= main_~i~0 55)} is VALID [2018-11-23 12:11:51,873 INFO L273 TraceCheckUtils]: 61: Hoare triple {19090#(<= main_~i~0 55)} assume !(~i~0 < 100000); {19034#false} is VALID [2018-11-23 12:11:51,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {19034#false} ~i~0 := 1; {19034#false} is VALID [2018-11-23 12:11:51,874 INFO L273 TraceCheckUtils]: 63: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,874 INFO L273 TraceCheckUtils]: 64: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,874 INFO L273 TraceCheckUtils]: 65: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,875 INFO L273 TraceCheckUtils]: 67: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,875 INFO L273 TraceCheckUtils]: 68: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,875 INFO L273 TraceCheckUtils]: 69: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,875 INFO L273 TraceCheckUtils]: 70: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,875 INFO L273 TraceCheckUtils]: 71: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,876 INFO L273 TraceCheckUtils]: 72: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,876 INFO L273 TraceCheckUtils]: 73: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,876 INFO L273 TraceCheckUtils]: 74: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,876 INFO L273 TraceCheckUtils]: 75: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~0, 4);call write~int(#t~mem1, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~mem1;~i~0 := 5 + ~i~0;~j~0 := 1 + ~j~0; {19034#false} is VALID [2018-11-23 12:11:51,876 INFO L273 TraceCheckUtils]: 76: Hoare triple {19034#false} assume !(~i~0 < 100000); {19034#false} is VALID [2018-11-23 12:11:51,877 INFO L273 TraceCheckUtils]: 77: Hoare triple {19034#false} ~i~0 := 1;~j~0 := 0; {19034#false} is VALID [2018-11-23 12:11:51,877 INFO L273 TraceCheckUtils]: 78: Hoare triple {19034#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + 4 * (1 + 5 * ~j~0), 4); {19034#false} is VALID [2018-11-23 12:11:51,877 INFO L256 TraceCheckUtils]: 79: Hoare triple {19034#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {19034#false} is VALID [2018-11-23 12:11:51,877 INFO L273 TraceCheckUtils]: 80: Hoare triple {19034#false} ~cond := #in~cond; {19034#false} is VALID [2018-11-23 12:11:51,877 INFO L273 TraceCheckUtils]: 81: Hoare triple {19034#false} assume 0 == ~cond; {19034#false} is VALID [2018-11-23 12:11:51,878 INFO L273 TraceCheckUtils]: 82: Hoare triple {19034#false} assume !false; {19034#false} is VALID [2018-11-23 12:11:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1631 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 12:11:51,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:51,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:11:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:11:51,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:11:51,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:52,002 INFO L273 TraceCheckSpWp]: Computing forward predicates...