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_copy1_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,525 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,525 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:45,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,567 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,568 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,571 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,572 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,574 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,574 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,575 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,575 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,576 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,643 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-23 11:51:45,705 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eeb307b3/357af070800a41fd81c5e5ed14cfed4f/FLAG899a86b93 [2018-11-23 11:51:46,133 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:46,134 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-23 11:51:46,140 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eeb307b3/357af070800a41fd81c5e5ed14cfed4f/FLAG899a86b93 [2018-11-23 11:51:46,526 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eeb307b3/357af070800a41fd81c5e5ed14cfed4f [2018-11-23 11:51:46,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4176cb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46, skipping insertion in model container [2018-11-23 11:51:46,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,842 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,847 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,878 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,902 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46 WrapperNode [2018-11-23 11:51:46,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:47,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:47,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:47,644 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:47,645 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:51:47,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47 BoogieIcfgContainer [2018-11-23 11:51:47,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:47,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:47,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:47,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:47,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:47,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d60c1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:47,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d60c1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47" (3/3) ... [2018-11-23 11:51:47,656 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy1_false-unreach-call_ground.i [2018-11-23 11:51:47,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:47,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:47,690 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:47,725 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:47,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:47,726 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:47,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:47,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:47,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:47,727 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:47,728 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:47,728 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:51:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:51:47,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:47,756 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2018-11-23 11:51:47,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:51:47,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30#true} is VALID [2018-11-23 11:51:47,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:51:47,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-23 11:51:47,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret8 := main(); {30#true} is VALID [2018-11-23 11:51:47,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {30#true} is VALID [2018-11-23 11:51:47,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:51:47,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} havoc ~i~0;~i~0 := 0; {31#false} is VALID [2018-11-23 11:51:47,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !(~i~0 < 100000); {31#false} is VALID [2018-11-23 11:51:47,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} havoc ~x~0;~x~0 := 0; {31#false} is VALID [2018-11-23 11:51:47,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {31#false} is VALID [2018-11-23 11:51:47,921 INFO L256 TraceCheckUtils]: 11: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {31#false} is VALID [2018-11-23 11:51:47,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:51:47,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2018-11-23 11:51:47,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:51:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:47,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:47,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:47,933 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:51:47,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:47,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,038 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 11:51:48,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,051 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:51:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,365 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 11:51:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:51:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:51:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-23 11:51:48,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-23 11:51:48,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,532 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:51:48,533 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:51:48,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:51:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:51:48,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:48,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:51:48,682 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:51:48,682 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:51:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,687 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:51:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:51:48,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,688 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:51:48,688 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:51:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,692 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:51:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:51:48,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:48,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:51:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 11:51:48,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 11:51:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:48,699 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 11:51:48,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 11:51:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:51:48,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2018-11-23 11:51:48,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-23 11:51:48,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {168#true} is VALID [2018-11-23 11:51:48,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 11:51:48,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #63#return; {168#true} is VALID [2018-11-23 11:51:48,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret8 := main(); {168#true} is VALID [2018-11-23 11:51:48,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {170#(= main_~a~0 0)} is VALID [2018-11-23 11:51:48,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {170#(= main_~a~0 0)} assume !(~a~0 < 100000); {169#false} is VALID [2018-11-23 11:51:48,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {169#false} havoc ~i~0;~i~0 := 0; {169#false} is VALID [2018-11-23 11:51:48,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {169#false} assume !(~i~0 < 100000); {169#false} is VALID [2018-11-23 11:51:48,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#false} havoc ~x~0;~x~0 := 0; {169#false} is VALID [2018-11-23 11:51:48,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {169#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {169#false} is VALID [2018-11-23 11:51:48,946 INFO L256 TraceCheckUtils]: 11: Hoare triple {169#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {169#false} is VALID [2018-11-23 11:51:48,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2018-11-23 11:51:48,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2018-11-23 11:51:48,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-23 11:51:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:48,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:48,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:51:48,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,027 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 11:51:49,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,030 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 11:51:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,194 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 11:51:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:51:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:51:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-23 11:51:49,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-23 11:51:49,404 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 11:51:49,406 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:51:49,406 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:51:49,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:51:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:51:49,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:51:49,551 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:51:49,551 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:51:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,554 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:51:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:51:49,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,555 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:51:49,555 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:51:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,558 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:51:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:51:49,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:51:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:51:49,562 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 11:51:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,563 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:51:49,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:51:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:51:49,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,565 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1578997828, now seen corresponding path program 1 times [2018-11-23 11:51:49,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2018-11-23 11:51:49,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {306#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {306#true} is VALID [2018-11-23 11:51:49,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2018-11-23 11:51:49,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #63#return; {306#true} is VALID [2018-11-23 11:51:49,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret8 := main(); {306#true} is VALID [2018-11-23 11:51:49,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {306#true} is VALID [2018-11-23 11:51:49,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {306#true} is VALID [2018-11-23 11:51:49,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {306#true} is VALID [2018-11-23 11:51:49,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {306#true} assume !(~a~0 < 100000); {306#true} is VALID [2018-11-23 11:51:49,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {306#true} havoc ~i~0;~i~0 := 0; {308#(= main_~i~0 0)} is VALID [2018-11-23 11:51:49,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(= main_~i~0 0)} assume !(~i~0 < 100000); {307#false} is VALID [2018-11-23 11:51:49,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {307#false} havoc ~x~0;~x~0 := 0; {307#false} is VALID [2018-11-23 11:51:49,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {307#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {307#false} is VALID [2018-11-23 11:51:49,740 INFO L256 TraceCheckUtils]: 13: Hoare triple {307#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {307#false} is VALID [2018-11-23 11:51:49,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2018-11-23 11:51:49,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2018-11-23 11:51:49,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {307#false} assume !false; {307#false} is VALID [2018-11-23 11:51:49,744 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 11:51:49,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:51:49,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,796 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-23 11:51:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,034 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:51:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:51:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:51:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 11:51:50,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 11:51:50,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,154 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:51:50,154 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:51:50,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:51:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 11:51:50,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 11:51:50,167 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 11:51:50,167 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 11:51:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,170 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:51:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:51:50,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,171 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 11:51:50,172 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 11:51:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,174 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:51:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:51:50,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:51:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 11:51:50,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2018-11-23 11:51:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,178 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 11:51:50,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:51:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:50,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,179 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2018-11-23 11:51:50,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2018-11-23 11:51:50,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {446#true} is VALID [2018-11-23 11:51:50,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2018-11-23 11:51:50,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #63#return; {446#true} is VALID [2018-11-23 11:51:50,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret8 := main(); {446#true} is VALID [2018-11-23 11:51:50,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {446#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {448#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {448#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {448#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {448#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {449#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:50,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#(<= main_~a~0 1)} assume !(~a~0 < 100000); {447#false} is VALID [2018-11-23 11:51:50,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {447#false} havoc ~i~0;~i~0 := 0; {447#false} is VALID [2018-11-23 11:51:50,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {447#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {447#false} is VALID [2018-11-23 11:51:50,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {447#false} is VALID [2018-11-23 11:51:50,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#false} assume !(~i~0 < 100000); {447#false} is VALID [2018-11-23 11:51:50,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#false} havoc ~x~0;~x~0 := 0; {447#false} is VALID [2018-11-23 11:51:50,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {447#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {447#false} is VALID [2018-11-23 11:51:50,332 INFO L256 TraceCheckUtils]: 15: Hoare triple {447#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {447#false} is VALID [2018-11-23 11:51:50,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {447#false} ~cond := #in~cond; {447#false} is VALID [2018-11-23 11:51:50,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {447#false} assume 0 == ~cond; {447#false} is VALID [2018-11-23 11:51:50,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {447#false} assume !false; {447#false} is VALID [2018-11-23 11:51:50,337 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 11:51:50,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:50,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:50,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:50,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2018-11-23 11:51:50,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {446#true} is VALID [2018-11-23 11:51:50,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2018-11-23 11:51:50,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #63#return; {446#true} is VALID [2018-11-23 11:51:50,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret8 := main(); {446#true} is VALID [2018-11-23 11:51:50,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {446#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {468#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:50,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {468#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:50,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {449#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:50,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#(<= main_~a~0 1)} assume !(~a~0 < 100000); {447#false} is VALID [2018-11-23 11:51:50,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {447#false} havoc ~i~0;~i~0 := 0; {447#false} is VALID [2018-11-23 11:51:50,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {447#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {447#false} is VALID [2018-11-23 11:51:50,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {447#false} is VALID [2018-11-23 11:51:50,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#false} assume !(~i~0 < 100000); {447#false} is VALID [2018-11-23 11:51:50,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#false} havoc ~x~0;~x~0 := 0; {447#false} is VALID [2018-11-23 11:51:50,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {447#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {447#false} is VALID [2018-11-23 11:51:50,675 INFO L256 TraceCheckUtils]: 15: Hoare triple {447#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {447#false} is VALID [2018-11-23 11:51:50,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {447#false} ~cond := #in~cond; {447#false} is VALID [2018-11-23 11:51:50,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {447#false} assume 0 == ~cond; {447#false} is VALID [2018-11-23 11:51:50,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {447#false} assume !false; {447#false} is VALID [2018-11-23 11:51:50,677 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 11:51:50,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:50,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:50,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:51:50,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:50,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:50,738 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2018-11-23 11:51:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,069 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:51:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:51:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 11:51:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2018-11-23 11:51:51,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2018-11-23 11:51:51,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,259 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:51:51,259 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:51:51,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:51:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 11:51:51,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 11:51:51,282 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 11:51:51,283 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 11:51:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,284 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:51:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:51:51,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,288 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 11:51:51,288 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 11:51:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,291 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:51:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:51:51,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:51:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 11:51:51,297 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-11-23 11:51:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,297 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 11:51:51,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:51:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:51:51,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,299 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:51,299 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash 64185792, now seen corresponding path program 2 times [2018-11-23 11:51:51,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2018-11-23 11:51:51,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {658#true} is VALID [2018-11-23 11:51:51,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-23 11:51:51,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #63#return; {658#true} is VALID [2018-11-23 11:51:51,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret8 := main(); {658#true} is VALID [2018-11-23 11:51:51,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {658#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {660#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {660#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {662#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:51,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(<= main_~a~0 2)} assume !(~a~0 < 100000); {659#false} is VALID [2018-11-23 11:51:51,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#false} havoc ~i~0;~i~0 := 0; {659#false} is VALID [2018-11-23 11:51:51,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {659#false} is VALID [2018-11-23 11:51:51,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {659#false} is VALID [2018-11-23 11:51:51,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#false} assume !(~i~0 < 100000); {659#false} is VALID [2018-11-23 11:51:51,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#false} havoc ~x~0;~x~0 := 0; {659#false} is VALID [2018-11-23 11:51:51,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {659#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {659#false} is VALID [2018-11-23 11:51:51,475 INFO L256 TraceCheckUtils]: 17: Hoare triple {659#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {659#false} is VALID [2018-11-23 11:51:51,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2018-11-23 11:51:51,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2018-11-23 11:51:51,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2018-11-23 11:51:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:51,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:51,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:51,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:51,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2018-11-23 11:51:51,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {658#true} is VALID [2018-11-23 11:51:51,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2018-11-23 11:51:51,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #63#return; {658#true} is VALID [2018-11-23 11:51:51,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret8 := main(); {658#true} is VALID [2018-11-23 11:51:51,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {658#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {681#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {681#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {661#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {661#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {661#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {662#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:51,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(<= main_~a~0 2)} assume !(~a~0 < 100000); {659#false} is VALID [2018-11-23 11:51:51,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {659#false} havoc ~i~0;~i~0 := 0; {659#false} is VALID [2018-11-23 11:51:51,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {659#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {659#false} is VALID [2018-11-23 11:51:51,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {659#false} is VALID [2018-11-23 11:51:51,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#false} assume !(~i~0 < 100000); {659#false} is VALID [2018-11-23 11:51:51,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#false} havoc ~x~0;~x~0 := 0; {659#false} is VALID [2018-11-23 11:51:51,669 INFO L273 TraceCheckUtils]: 16: Hoare triple {659#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {659#false} is VALID [2018-11-23 11:51:51,669 INFO L256 TraceCheckUtils]: 17: Hoare triple {659#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {659#false} is VALID [2018-11-23 11:51:51,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {659#false} ~cond := #in~cond; {659#false} is VALID [2018-11-23 11:51:51,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {659#false} assume 0 == ~cond; {659#false} is VALID [2018-11-23 11:51:51,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2018-11-23 11:51:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:51,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:51:51,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:51:51,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:51:51,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:51:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:51:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:51,738 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-23 11:51:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,936 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 11:51:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:51,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 11:51:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:51:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:51:51,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 11:51:52,021 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 11:51:52,023 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:51:52,023 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:51:52,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:51:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 11:51:52,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 11:51:52,040 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 11:51:52,040 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 11:51:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,042 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:51:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:51:52,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,043 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 11:51:52,044 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 11:51:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,045 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:51:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:51:52,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:51:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 11:51:52,048 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2018-11-23 11:51:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,049 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 11:51:52,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:51:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 11:51:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:51:52,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,050 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,050 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1131404638, now seen corresponding path program 3 times [2018-11-23 11:51:52,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2018-11-23 11:51:52,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {887#true} is VALID [2018-11-23 11:51:52,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2018-11-23 11:51:52,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #63#return; {887#true} is VALID [2018-11-23 11:51:52,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret8 := main(); {887#true} is VALID [2018-11-23 11:51:52,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {887#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {889#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {889#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {889#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {889#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {890#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {890#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {890#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {891#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {891#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {891#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:52,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {892#(<= main_~a~0 3)} assume !(~a~0 < 100000); {888#false} is VALID [2018-11-23 11:51:52,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {888#false} havoc ~i~0;~i~0 := 0; {888#false} is VALID [2018-11-23 11:51:52,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {888#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {888#false} is VALID [2018-11-23 11:51:52,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {888#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {888#false} is VALID [2018-11-23 11:51:52,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {888#false} assume !(~i~0 < 100000); {888#false} is VALID [2018-11-23 11:51:52,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#false} havoc ~x~0;~x~0 := 0; {888#false} is VALID [2018-11-23 11:51:52,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {888#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {888#false} is VALID [2018-11-23 11:51:52,258 INFO L256 TraceCheckUtils]: 19: Hoare triple {888#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {888#false} is VALID [2018-11-23 11:51:52,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2018-11-23 11:51:52,258 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#false} assume 0 == ~cond; {888#false} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 22: Hoare triple {888#false} assume !false; {888#false} is VALID [2018-11-23 11:51:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:52,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,261 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:52,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:51:52,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2018-11-23 11:51:52,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {887#true} is VALID [2018-11-23 11:51:52,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2018-11-23 11:51:52,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #63#return; {887#true} is VALID [2018-11-23 11:51:52,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret8 := main(); {887#true} is VALID [2018-11-23 11:51:52,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {887#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {887#true} is VALID [2018-11-23 11:51:52,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {887#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {887#true} is VALID [2018-11-23 11:51:52,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {887#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {887#true} is VALID [2018-11-23 11:51:52,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {887#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {887#true} is VALID [2018-11-23 11:51:52,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {887#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {887#true} is VALID [2018-11-23 11:51:52,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {887#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {887#true} is VALID [2018-11-23 11:51:52,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {887#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {887#true} is VALID [2018-11-23 11:51:52,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {887#true} assume !(~a~0 < 100000); {887#true} is VALID [2018-11-23 11:51:52,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {887#true} havoc ~i~0;~i~0 := 0; {935#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {935#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {935#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {942#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {942#(<= main_~i~0 1)} assume !(~i~0 < 100000); {888#false} is VALID [2018-11-23 11:51:52,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#false} havoc ~x~0;~x~0 := 0; {888#false} is VALID [2018-11-23 11:51:52,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {888#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {888#false} is VALID [2018-11-23 11:51:52,377 INFO L256 TraceCheckUtils]: 19: Hoare triple {888#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {888#false} is VALID [2018-11-23 11:51:52,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2018-11-23 11:51:52,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {888#false} assume 0 == ~cond; {888#false} is VALID [2018-11-23 11:51:52,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {888#false} assume !false; {888#false} is VALID [2018-11-23 11:51:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:51:52,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 11:51:52,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:51:52,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:52,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:52,454 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-23 11:51:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,777 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 11:51:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:51:52,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:51:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:51:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-23 11:51:52,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2018-11-23 11:51:52,863 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 11:51:52,865 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:51:52,865 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:51:52,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:51:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 11:51:52,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 11:51:52,913 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 11:51:52,913 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 11:51:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,915 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:51:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:51:52,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,916 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 11:51:52,916 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 11:51:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,918 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 11:51:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:51:52,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:51:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 11:51:52,921 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-11-23 11:51:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,922 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 11:51:52,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:51:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:51:52,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,923 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,924 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash -806191654, now seen corresponding path program 4 times [2018-11-23 11:51:52,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 11:51:53,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1147#true} is VALID [2018-11-23 11:51:53,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:51:53,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #63#return; {1147#true} is VALID [2018-11-23 11:51:53,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {1147#true} call #t~ret8 := main(); {1147#true} is VALID [2018-11-23 11:51:53,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {1147#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1149#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {1149#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1149#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {1149#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {1150#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {1151#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {1151#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1153#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:53,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1148#false} is VALID [2018-11-23 11:51:53,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {1148#false} havoc ~i~0;~i~0 := 0; {1148#false} is VALID [2018-11-23 11:51:53,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1148#false} is VALID [2018-11-23 11:51:53,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {1148#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1148#false} is VALID [2018-11-23 11:51:53,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1148#false} is VALID [2018-11-23 11:51:53,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {1148#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1148#false} is VALID [2018-11-23 11:51:53,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1148#false} assume !(~i~0 < 100000); {1148#false} is VALID [2018-11-23 11:51:53,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {1148#false} havoc ~x~0;~x~0 := 0; {1148#false} is VALID [2018-11-23 11:51:53,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {1148#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1148#false} is VALID [2018-11-23 11:51:53,122 INFO L256 TraceCheckUtils]: 23: Hoare triple {1148#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1148#false} is VALID [2018-11-23 11:51:53,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {1148#false} ~cond := #in~cond; {1148#false} is VALID [2018-11-23 11:51:53,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {1148#false} assume 0 == ~cond; {1148#false} is VALID [2018-11-23 11:51:53,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 11:51:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:53,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:53,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:53,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:53,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 11:51:53,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1147#true} is VALID [2018-11-23 11:51:53,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 11:51:53,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1147#true} {1147#true} #63#return; {1147#true} is VALID [2018-11-23 11:51:53,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {1147#true} call #t~ret8 := main(); {1147#true} is VALID [2018-11-23 11:51:53,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {1147#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1172#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:53,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {1172#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1172#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:53,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {1172#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {1150#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1150#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {1150#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {1151#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1151#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {1151#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1152#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1153#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:53,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1148#false} is VALID [2018-11-23 11:51:53,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {1148#false} havoc ~i~0;~i~0 := 0; {1148#false} is VALID [2018-11-23 11:51:53,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1148#false} is VALID [2018-11-23 11:51:53,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {1148#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1148#false} is VALID [2018-11-23 11:51:53,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {1148#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1148#false} is VALID [2018-11-23 11:51:53,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {1148#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1148#false} is VALID [2018-11-23 11:51:53,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {1148#false} assume !(~i~0 < 100000); {1148#false} is VALID [2018-11-23 11:51:53,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {1148#false} havoc ~x~0;~x~0 := 0; {1148#false} is VALID [2018-11-23 11:51:53,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {1148#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1148#false} is VALID [2018-11-23 11:51:53,378 INFO L256 TraceCheckUtils]: 23: Hoare triple {1148#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1148#false} is VALID [2018-11-23 11:51:53,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {1148#false} ~cond := #in~cond; {1148#false} is VALID [2018-11-23 11:51:53,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {1148#false} assume 0 == ~cond; {1148#false} is VALID [2018-11-23 11:51:53,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 11:51:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:53,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:53,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:51:53,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:53,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,437 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-11-23 11:51:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,575 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 11:51:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:53,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 11:51:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 11:51:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 11:51:53,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2018-11-23 11:51:53,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,643 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:51:53,643 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:51:53,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:51:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 11:51:53,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 11:51:53,682 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 11:51:53,683 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 11:51:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,685 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:51:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 11:51:53,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,686 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 11:51:53,686 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 11:51:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,688 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:51:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 11:51:53,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:51:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 11:51:53,690 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2018-11-23 11:51:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,691 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 11:51:53,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 11:51:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:53,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,692 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:53,692 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1775089928, now seen corresponding path program 5 times [2018-11-23 11:51:53,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {1429#true} call ULTIMATE.init(); {1429#true} is VALID [2018-11-23 11:51:53,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {1429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1429#true} is VALID [2018-11-23 11:51:53,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2018-11-23 11:51:53,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #63#return; {1429#true} is VALID [2018-11-23 11:51:53,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret8 := main(); {1429#true} is VALID [2018-11-23 11:51:53,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {1429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1431#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {1431#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1431#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {1431#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1432#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {1432#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1432#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {1432#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1433#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {1433#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1433#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {1433#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1434#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {1434#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1434#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {1434#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1435#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:53,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {1435#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1435#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:53,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {1435#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1436#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:53,928 INFO L273 TraceCheckUtils]: 16: Hoare triple {1436#(<= main_~a~0 5)} assume !(~a~0 < 100000); {1430#false} is VALID [2018-11-23 11:51:53,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {1430#false} havoc ~i~0;~i~0 := 0; {1430#false} is VALID [2018-11-23 11:51:53,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {1430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1430#false} is VALID [2018-11-23 11:51:53,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {1430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1430#false} is VALID [2018-11-23 11:51:53,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {1430#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1430#false} is VALID [2018-11-23 11:51:53,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {1430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1430#false} is VALID [2018-11-23 11:51:53,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {1430#false} assume !(~i~0 < 100000); {1430#false} is VALID [2018-11-23 11:51:53,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {1430#false} havoc ~x~0;~x~0 := 0; {1430#false} is VALID [2018-11-23 11:51:53,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {1430#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1430#false} is VALID [2018-11-23 11:51:53,931 INFO L256 TraceCheckUtils]: 25: Hoare triple {1430#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1430#false} is VALID [2018-11-23 11:51:53,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {1430#false} ~cond := #in~cond; {1430#false} is VALID [2018-11-23 11:51:53,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {1430#false} assume 0 == ~cond; {1430#false} is VALID [2018-11-23 11:51:53,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2018-11-23 11:51:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:53,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:53,950 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:54,044 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:54,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {1429#true} call ULTIMATE.init(); {1429#true} is VALID [2018-11-23 11:51:54,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {1429#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1429#true} is VALID [2018-11-23 11:51:54,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {1429#true} assume true; {1429#true} is VALID [2018-11-23 11:51:54,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1429#true} {1429#true} #63#return; {1429#true} is VALID [2018-11-23 11:51:54,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {1429#true} call #t~ret8 := main(); {1429#true} is VALID [2018-11-23 11:51:54,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {1429#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1429#true} is VALID [2018-11-23 11:51:54,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {1429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1429#true} is VALID [2018-11-23 11:51:54,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:51:54,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {1429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1429#true} is VALID [2018-11-23 11:51:54,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:51:54,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {1429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1429#true} is VALID [2018-11-23 11:51:54,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:51:54,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {1429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1429#true} is VALID [2018-11-23 11:51:54,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:51:54,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {1429#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1429#true} is VALID [2018-11-23 11:51:54,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {1429#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1429#true} is VALID [2018-11-23 11:51:54,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {1429#true} assume !(~a~0 < 100000); {1429#true} is VALID [2018-11-23 11:51:54,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {1429#true} havoc ~i~0;~i~0 := 0; {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:54,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {1491#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1491#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:54,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {1491#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1498#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1498#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {1498#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1505#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {1505#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1430#false} is VALID [2018-11-23 11:51:54,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {1430#false} havoc ~x~0;~x~0 := 0; {1430#false} is VALID [2018-11-23 11:51:54,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {1430#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1430#false} is VALID [2018-11-23 11:51:54,165 INFO L256 TraceCheckUtils]: 25: Hoare triple {1430#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1430#false} is VALID [2018-11-23 11:51:54,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {1430#false} ~cond := #in~cond; {1430#false} is VALID [2018-11-23 11:51:54,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {1430#false} assume 0 == ~cond; {1430#false} is VALID [2018-11-23 11:51:54,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {1430#false} assume !false; {1430#false} is VALID [2018-11-23 11:51:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:51:54,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 11:51:54,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 11:51:54,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:54,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:54,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:54,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:54,247 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2018-11-23 11:51:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,641 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-23 11:51:54,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:51:54,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 11:51:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2018-11-23 11:51:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2018-11-23 11:51:54,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 59 transitions. [2018-11-23 11:51:54,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,814 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:51:54,815 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:51:54,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:51:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 11:51:54,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-23 11:51:54,856 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-23 11:51:54,856 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-23 11:51:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,858 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:51:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:51:54,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,859 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-23 11:51:54,860 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-23 11:51:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,861 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:51:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:51:54,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:51:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 11:51:54,864 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 29 [2018-11-23 11:51:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,865 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 11:51:54,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 11:51:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:51:54,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,866 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,866 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1969191540, now seen corresponding path program 6 times [2018-11-23 11:51:54,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {1743#true} call ULTIMATE.init(); {1743#true} is VALID [2018-11-23 11:51:55,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {1743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1743#true} is VALID [2018-11-23 11:51:55,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {1743#true} assume true; {1743#true} is VALID [2018-11-23 11:51:55,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1743#true} {1743#true} #63#return; {1743#true} is VALID [2018-11-23 11:51:55,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {1743#true} call #t~ret8 := main(); {1743#true} is VALID [2018-11-23 11:51:55,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {1743#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1745#(= main_~a~0 0)} is VALID [2018-11-23 11:51:55,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {1745#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1745#(= main_~a~0 0)} is VALID [2018-11-23 11:51:55,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {1745#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1746#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {1746#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1746#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {1746#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1747#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {1747#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1747#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {1747#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1748#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {1748#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1748#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {1748#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1749#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:55,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {1749#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1749#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:55,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {1749#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1750#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:55,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {1750#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1750#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:55,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {1750#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1751#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:55,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {1751#(<= main_~a~0 6)} assume !(~a~0 < 100000); {1744#false} is VALID [2018-11-23 11:51:55,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {1744#false} havoc ~i~0;~i~0 := 0; {1744#false} is VALID [2018-11-23 11:51:55,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {1744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1744#false} is VALID [2018-11-23 11:51:55,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {1744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1744#false} is VALID [2018-11-23 11:51:55,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {1744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1744#false} is VALID [2018-11-23 11:51:55,719 INFO L273 TraceCheckUtils]: 23: Hoare triple {1744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1744#false} is VALID [2018-11-23 11:51:55,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {1744#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1744#false} is VALID [2018-11-23 11:51:55,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {1744#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1744#false} is VALID [2018-11-23 11:51:55,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {1744#false} assume !(~i~0 < 100000); {1744#false} is VALID [2018-11-23 11:51:55,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {1744#false} havoc ~x~0;~x~0 := 0; {1744#false} is VALID [2018-11-23 11:51:55,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {1744#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1744#false} is VALID [2018-11-23 11:51:55,722 INFO L256 TraceCheckUtils]: 29: Hoare triple {1744#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1744#false} is VALID [2018-11-23 11:51:55,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#false} ~cond := #in~cond; {1744#false} is VALID [2018-11-23 11:51:55,722 INFO L273 TraceCheckUtils]: 31: Hoare triple {1744#false} assume 0 == ~cond; {1744#false} is VALID [2018-11-23 11:51:55,722 INFO L273 TraceCheckUtils]: 32: Hoare triple {1744#false} assume !false; {1744#false} is VALID [2018-11-23 11:51:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:51:55,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:55,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:55,735 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:51:55,785 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:51:55,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {1743#true} call ULTIMATE.init(); {1743#true} is VALID [2018-11-23 11:51:55,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1743#true} is VALID [2018-11-23 11:51:55,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {1743#true} assume true; {1743#true} is VALID [2018-11-23 11:51:55,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1743#true} {1743#true} #63#return; {1743#true} is VALID [2018-11-23 11:51:55,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {1743#true} call #t~ret8 := main(); {1743#true} is VALID [2018-11-23 11:51:55,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {1743#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1743#true} is VALID [2018-11-23 11:51:55,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {1743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1743#true} is VALID [2018-11-23 11:51:55,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {1743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1743#true} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {1743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1743#true} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {1743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1743#true} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:51:55,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {1743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1743#true} is VALID [2018-11-23 11:51:55,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:51:55,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {1743#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1743#true} is VALID [2018-11-23 11:51:55,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {1743#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1743#true} is VALID [2018-11-23 11:51:55,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {1743#true} assume !(~a~0 < 100000); {1743#true} is VALID [2018-11-23 11:51:55,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {1743#true} havoc ~i~0;~i~0 := 0; {1812#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {1812#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1812#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:55,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {1812#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1819#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {1819#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1819#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:55,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {1819#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1826#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {1826#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1826#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {1826#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1833#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {1833#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1744#false} is VALID [2018-11-23 11:51:55,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {1744#false} havoc ~x~0;~x~0 := 0; {1744#false} is VALID [2018-11-23 11:51:55,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {1744#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1744#false} is VALID [2018-11-23 11:51:55,949 INFO L256 TraceCheckUtils]: 29: Hoare triple {1744#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1744#false} is VALID [2018-11-23 11:51:55,949 INFO L273 TraceCheckUtils]: 30: Hoare triple {1744#false} ~cond := #in~cond; {1744#false} is VALID [2018-11-23 11:51:55,949 INFO L273 TraceCheckUtils]: 31: Hoare triple {1744#false} assume 0 == ~cond; {1744#false} is VALID [2018-11-23 11:51:55,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {1744#false} assume !false; {1744#false} is VALID [2018-11-23 11:51:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:51:55,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 11:51:55,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 11:51:55,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:51:56,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:51:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:51:56,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:51:56,112 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 13 states. [2018-11-23 11:51:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,687 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 11:51:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:51:56,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 11:51:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:51:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2018-11-23 11:51:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:51:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 63 transitions. [2018-11-23 11:51:56,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 63 transitions. [2018-11-23 11:51:56,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:56,766 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:51:56,767 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:51:56,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:51:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:51:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-23 11:51:56,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-23 11:51:56,887 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-23 11:51:56,887 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-23 11:51:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,889 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:51:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:51:56,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,889 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-23 11:51:56,890 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-23 11:51:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,891 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 11:51:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:51:56,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:51:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 11:51:56,894 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2018-11-23 11:51:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,894 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 11:51:56,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:51:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 11:51:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:51:56,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,895 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:56,896 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash -811630608, now seen corresponding path program 7 times [2018-11-23 11:51:56,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2018-11-23 11:51:57,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2094#true} is VALID [2018-11-23 11:51:57,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2018-11-23 11:51:57,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #63#return; {2094#true} is VALID [2018-11-23 11:51:57,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret8 := main(); {2094#true} is VALID [2018-11-23 11:51:57,418 INFO L273 TraceCheckUtils]: 5: Hoare triple {2094#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2096#(= main_~a~0 0)} is VALID [2018-11-23 11:51:57,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {2096#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2096#(= main_~a~0 0)} is VALID [2018-11-23 11:51:57,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {2096#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {2097#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {2098#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {2099#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:57,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {2100#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:57,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:57,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {2101#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:57,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:57,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {2102#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:57,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2103#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:57,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2095#false} is VALID [2018-11-23 11:51:57,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#false} havoc ~i~0;~i~0 := 0; {2095#false} is VALID [2018-11-23 11:51:57,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,427 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,428 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,428 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,428 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !(~i~0 < 100000); {2095#false} is VALID [2018-11-23 11:51:57,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {2095#false} havoc ~x~0;~x~0 := 0; {2095#false} is VALID [2018-11-23 11:51:57,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {2095#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2095#false} is VALID [2018-11-23 11:51:57,430 INFO L256 TraceCheckUtils]: 33: Hoare triple {2095#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2095#false} is VALID [2018-11-23 11:51:57,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2018-11-23 11:51:57,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2018-11-23 11:51:57,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2018-11-23 11:51:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:51:57,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:57,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:57,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:57,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:57,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2018-11-23 11:51:57,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2094#true} is VALID [2018-11-23 11:51:57,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2018-11-23 11:51:57,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #63#return; {2094#true} is VALID [2018-11-23 11:51:57,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret8 := main(); {2094#true} is VALID [2018-11-23 11:51:57,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {2094#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2122#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:57,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {2122#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2122#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:57,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {2097#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2097#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:57,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {2097#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {2098#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2098#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:57,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {2098#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {2099#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2099#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:57,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {2099#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:57,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {2100#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2100#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:57,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {2100#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:57,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {2101#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2101#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:57,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {2101#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:57,636 INFO L273 TraceCheckUtils]: 18: Hoare triple {2102#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2102#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:57,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {2102#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2103#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:57,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {2103#(<= main_~a~0 7)} assume !(~a~0 < 100000); {2095#false} is VALID [2018-11-23 11:51:57,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#false} havoc ~i~0;~i~0 := 0; {2095#false} is VALID [2018-11-23 11:51:57,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,638 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,639 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2095#false} is VALID [2018-11-23 11:51:57,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2095#false} is VALID [2018-11-23 11:51:57,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !(~i~0 < 100000); {2095#false} is VALID [2018-11-23 11:51:57,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {2095#false} havoc ~x~0;~x~0 := 0; {2095#false} is VALID [2018-11-23 11:51:57,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {2095#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2095#false} is VALID [2018-11-23 11:51:57,641 INFO L256 TraceCheckUtils]: 33: Hoare triple {2095#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2095#false} is VALID [2018-11-23 11:51:57,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2018-11-23 11:51:57,641 INFO L273 TraceCheckUtils]: 35: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2018-11-23 11:51:57,641 INFO L273 TraceCheckUtils]: 36: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2018-11-23 11:51:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:51:57,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:57,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:51:57,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:51:57,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:57,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:57,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:57,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:57,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:57,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:57,714 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-11-23 11:51:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,029 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 11:51:58,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:51:58,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:51:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-23 11:51:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-23 11:51:58,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2018-11-23 11:51:58,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,112 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:51:58,112 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:51:58,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:51:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 11:51:58,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:58,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:58,149 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:58,150 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 11:51:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,152 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 11:51:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 11:51:58,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,153 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:58,153 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 11:51:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,154 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 11:51:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 11:51:58,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:58,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:58,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:58,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:51:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 11:51:58,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 37 [2018-11-23 11:51:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:58,156 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 11:51:58,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 11:51:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:51:58,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:58,157 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:58,158 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash 373619598, now seen corresponding path program 8 times [2018-11-23 11:51:58,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {2465#true} call ULTIMATE.init(); {2465#true} is VALID [2018-11-23 11:51:58,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {2465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2465#true} is VALID [2018-11-23 11:51:58,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {2465#true} assume true; {2465#true} is VALID [2018-11-23 11:51:58,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2465#true} {2465#true} #63#return; {2465#true} is VALID [2018-11-23 11:51:58,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {2465#true} call #t~ret8 := main(); {2465#true} is VALID [2018-11-23 11:51:58,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {2465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2467#(= main_~a~0 0)} is VALID [2018-11-23 11:51:58,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {2467#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2467#(= main_~a~0 0)} is VALID [2018-11-23 11:51:58,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {2467#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {2468#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {2468#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {2469#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {2469#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {2470#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {2470#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {2471#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {2471#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {2472#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {2472#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {2473#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {2473#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:58,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {2474#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:58,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {2474#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2475#(<= main_~a~0 8)} is VALID [2018-11-23 11:51:58,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {2475#(<= main_~a~0 8)} assume !(~a~0 < 100000); {2466#false} is VALID [2018-11-23 11:51:58,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {2466#false} havoc ~i~0;~i~0 := 0; {2466#false} is VALID [2018-11-23 11:51:58,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {2466#false} assume !(~i~0 < 100000); {2466#false} is VALID [2018-11-23 11:51:58,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#false} havoc ~x~0;~x~0 := 0; {2466#false} is VALID [2018-11-23 11:51:58,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {2466#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2466#false} is VALID [2018-11-23 11:51:58,417 INFO L256 TraceCheckUtils]: 35: Hoare triple {2466#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2466#false} is VALID [2018-11-23 11:51:58,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {2466#false} ~cond := #in~cond; {2466#false} is VALID [2018-11-23 11:51:58,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {2466#false} assume 0 == ~cond; {2466#false} is VALID [2018-11-23 11:51:58,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {2466#false} assume !false; {2466#false} is VALID [2018-11-23 11:51:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:51:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:58,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:58,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:58,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:58,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {2465#true} call ULTIMATE.init(); {2465#true} is VALID [2018-11-23 11:51:58,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {2465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2465#true} is VALID [2018-11-23 11:51:58,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {2465#true} assume true; {2465#true} is VALID [2018-11-23 11:51:58,659 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2465#true} {2465#true} #63#return; {2465#true} is VALID [2018-11-23 11:51:58,659 INFO L256 TraceCheckUtils]: 4: Hoare triple {2465#true} call #t~ret8 := main(); {2465#true} is VALID [2018-11-23 11:51:58,660 INFO L273 TraceCheckUtils]: 5: Hoare triple {2465#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2494#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:58,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {2494#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2494#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:58,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {2494#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {2468#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2468#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:58,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {2468#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {2469#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2469#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:58,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {2469#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {2470#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2470#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:58,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {2470#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {2471#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2471#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:58,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {2471#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {2472#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2472#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:58,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {2472#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {2473#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2473#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:58,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {2473#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:58,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {2474#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2474#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:58,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {2474#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2475#(<= main_~a~0 8)} is VALID [2018-11-23 11:51:58,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {2475#(<= main_~a~0 8)} assume !(~a~0 < 100000); {2466#false} is VALID [2018-11-23 11:51:58,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {2466#false} havoc ~i~0;~i~0 := 0; {2466#false} is VALID [2018-11-23 11:51:58,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,671 INFO L273 TraceCheckUtils]: 25: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {2466#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2466#false} is VALID [2018-11-23 11:51:58,672 INFO L273 TraceCheckUtils]: 31: Hoare triple {2466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2466#false} is VALID [2018-11-23 11:51:58,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {2466#false} assume !(~i~0 < 100000); {2466#false} is VALID [2018-11-23 11:51:58,672 INFO L273 TraceCheckUtils]: 33: Hoare triple {2466#false} havoc ~x~0;~x~0 := 0; {2466#false} is VALID [2018-11-23 11:51:58,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {2466#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2466#false} is VALID [2018-11-23 11:51:58,673 INFO L256 TraceCheckUtils]: 35: Hoare triple {2466#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2466#false} is VALID [2018-11-23 11:51:58,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {2466#false} ~cond := #in~cond; {2466#false} is VALID [2018-11-23 11:51:58,673 INFO L273 TraceCheckUtils]: 37: Hoare triple {2466#false} assume 0 == ~cond; {2466#false} is VALID [2018-11-23 11:51:58,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {2466#false} assume !false; {2466#false} is VALID [2018-11-23 11:51:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:51:58,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:58,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:51:58,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:51:58,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:58,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:58,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:58,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:58,736 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-23 11:51:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,120 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 11:51:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:51:59,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-23 11:51:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 11:51:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 11:51:59,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2018-11-23 11:51:59,177 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 11:51:59,178 INFO L225 Difference]: With dead ends: 68 [2018-11-23 11:51:59,178 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:51:59,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:51:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 11:51:59,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:59,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 11:51:59,194 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 11:51:59,194 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 11:51:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,195 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:51:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 11:51:59,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,195 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 11:51:59,195 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 11:51:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,196 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 11:51:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 11:51:59,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:59,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:51:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 11:51:59,198 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2018-11-23 11:51:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:59,198 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 11:51:59,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 11:51:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:51:59,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:59,199 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:59,199 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:59,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1232734124, now seen corresponding path program 9 times [2018-11-23 11:51:59,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:59,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {2853#true} call ULTIMATE.init(); {2853#true} is VALID [2018-11-23 11:51:59,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {2853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2853#true} is VALID [2018-11-23 11:51:59,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {2853#true} assume true; {2853#true} is VALID [2018-11-23 11:51:59,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2853#true} {2853#true} #63#return; {2853#true} is VALID [2018-11-23 11:51:59,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {2853#true} call #t~ret8 := main(); {2853#true} is VALID [2018-11-23 11:51:59,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {2853#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2855#(= main_~a~0 0)} is VALID [2018-11-23 11:51:59,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {2855#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2855#(= main_~a~0 0)} is VALID [2018-11-23 11:51:59,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {2855#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2856#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {2856#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2856#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:59,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {2856#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2857#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {2857#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2857#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:59,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {2857#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2858#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {2858#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2858#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:59,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {2858#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2859#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {2859#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2859#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:59,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {2859#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2860#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {2860#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2860#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:59,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {2860#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2861#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:59,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {2861#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2861#(<= main_~a~0 6)} is VALID [2018-11-23 11:51:59,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {2861#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2862#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:59,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {2862#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2862#(<= main_~a~0 7)} is VALID [2018-11-23 11:51:59,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {2862#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2863#(<= main_~a~0 8)} is VALID [2018-11-23 11:51:59,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {2863#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2863#(<= main_~a~0 8)} is VALID [2018-11-23 11:51:59,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {2863#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2864#(<= main_~a~0 9)} is VALID [2018-11-23 11:51:59,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {2864#(<= main_~a~0 9)} assume !(~a~0 < 100000); {2854#false} is VALID [2018-11-23 11:51:59,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {2854#false} havoc ~i~0;~i~0 := 0; {2854#false} is VALID [2018-11-23 11:51:59,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2854#false} is VALID [2018-11-23 11:51:59,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {2854#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2854#false} is VALID [2018-11-23 11:51:59,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2854#false} is VALID [2018-11-23 11:51:59,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {2854#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2854#false} is VALID [2018-11-23 11:51:59,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2854#false} is VALID [2018-11-23 11:51:59,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {2854#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2854#false} is VALID [2018-11-23 11:51:59,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {2854#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2854#false} is VALID [2018-11-23 11:51:59,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {2854#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2854#false} is VALID [2018-11-23 11:51:59,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {2854#false} assume !(~i~0 < 100000); {2854#false} is VALID [2018-11-23 11:51:59,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {2854#false} havoc ~x~0;~x~0 := 0; {2854#false} is VALID [2018-11-23 11:51:59,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {2854#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2854#false} is VALID [2018-11-23 11:51:59,729 INFO L256 TraceCheckUtils]: 37: Hoare triple {2854#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2854#false} is VALID [2018-11-23 11:51:59,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {2854#false} ~cond := #in~cond; {2854#false} is VALID [2018-11-23 11:51:59,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {2854#false} assume 0 == ~cond; {2854#false} is VALID [2018-11-23 11:51:59,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {2854#false} assume !false; {2854#false} is VALID [2018-11-23 11:51:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:51:59,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:59,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:59,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:51:59,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {2853#true} call ULTIMATE.init(); {2853#true} is VALID [2018-11-23 11:51:59,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {2853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2853#true} is VALID [2018-11-23 11:51:59,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {2853#true} assume true; {2853#true} is VALID [2018-11-23 11:51:59,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2853#true} {2853#true} #63#return; {2853#true} is VALID [2018-11-23 11:51:59,878 INFO L256 TraceCheckUtils]: 4: Hoare triple {2853#true} call #t~ret8 := main(); {2853#true} is VALID [2018-11-23 11:51:59,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {2853#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2853#true} is VALID [2018-11-23 11:51:59,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 12: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {2853#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {2853#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2853#true} is VALID [2018-11-23 11:51:59,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {2853#true} assume !(~a~0 < 100000); {2853#true} is VALID [2018-11-23 11:51:59,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {2853#true} havoc ~i~0;~i~0 := 0; {2943#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {2943#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2943#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {2943#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2950#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {2950#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2950#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {2950#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2957#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {2957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2957#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {2957#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2964#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {2964#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2964#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {2964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2971#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {2971#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2854#false} is VALID [2018-11-23 11:51:59,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {2854#false} havoc ~x~0;~x~0 := 0; {2854#false} is VALID [2018-11-23 11:51:59,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {2854#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2854#false} is VALID [2018-11-23 11:51:59,887 INFO L256 TraceCheckUtils]: 37: Hoare triple {2854#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2854#false} is VALID [2018-11-23 11:51:59,887 INFO L273 TraceCheckUtils]: 38: Hoare triple {2854#false} ~cond := #in~cond; {2854#false} is VALID [2018-11-23 11:51:59,888 INFO L273 TraceCheckUtils]: 39: Hoare triple {2854#false} assume 0 == ~cond; {2854#false} is VALID [2018-11-23 11:51:59,888 INFO L273 TraceCheckUtils]: 40: Hoare triple {2854#false} assume !false; {2854#false} is VALID [2018-11-23 11:51:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:51:59,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 11:51:59,908 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 11:51:59,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:51:59,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:51:59,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:51:59,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:51:59,956 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 17 states. [2018-11-23 11:52:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,383 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-23 11:52:00,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:00,384 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 11:52:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-23 11:52:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-23 11:52:00,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 71 transitions. [2018-11-23 11:52:00,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,456 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:52:00,456 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:52:00,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:52:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 11:52:00,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 11:52:00,480 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 11:52:00,481 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 11:52:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,483 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:52:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:52:00,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,484 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 11:52:00,484 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 11:52:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,485 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 11:52:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:52:00,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:52:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 11:52:00,488 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 41 [2018-11-23 11:52:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,488 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 11:52:00,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:52:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 11:52:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:52:00,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,489 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:00,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash 274047272, now seen corresponding path program 10 times [2018-11-23 11:52:00,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {3275#true} call ULTIMATE.init(); {3275#true} is VALID [2018-11-23 11:52:00,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {3275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3275#true} is VALID [2018-11-23 11:52:00,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#true} assume true; {3275#true} is VALID [2018-11-23 11:52:00,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#true} {3275#true} #63#return; {3275#true} is VALID [2018-11-23 11:52:00,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#true} call #t~ret8 := main(); {3275#true} is VALID [2018-11-23 11:52:00,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {3275#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3277#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {3277#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3277#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {3277#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {3278#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {3278#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {3279#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {3279#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {3280#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {3280#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {3281#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {3281#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,727 INFO L273 TraceCheckUtils]: 16: Hoare triple {3282#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {3282#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,728 INFO L273 TraceCheckUtils]: 18: Hoare triple {3283#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {3283#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:00,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:00,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {3284#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:00,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {3285#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:00,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {3285#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:00,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {3286#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:00,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {3286#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3287#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:00,734 INFO L273 TraceCheckUtils]: 26: Hoare triple {3287#(<= main_~a~0 10)} assume !(~a~0 < 100000); {3276#false} is VALID [2018-11-23 11:52:00,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {3276#false} havoc ~i~0;~i~0 := 0; {3276#false} is VALID [2018-11-23 11:52:00,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {3276#false} assume !(~i~0 < 100000); {3276#false} is VALID [2018-11-23 11:52:00,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {3276#false} havoc ~x~0;~x~0 := 0; {3276#false} is VALID [2018-11-23 11:52:00,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {3276#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3276#false} is VALID [2018-11-23 11:52:00,737 INFO L256 TraceCheckUtils]: 41: Hoare triple {3276#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3276#false} is VALID [2018-11-23 11:52:00,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {3276#false} ~cond := #in~cond; {3276#false} is VALID [2018-11-23 11:52:00,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {3276#false} assume 0 == ~cond; {3276#false} is VALID [2018-11-23 11:52:00,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {3276#false} assume !false; {3276#false} is VALID [2018-11-23 11:52:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:52:00,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:00,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:00,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:00,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:00,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {3275#true} call ULTIMATE.init(); {3275#true} is VALID [2018-11-23 11:52:00,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {3275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3275#true} is VALID [2018-11-23 11:52:00,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {3275#true} assume true; {3275#true} is VALID [2018-11-23 11:52:00,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3275#true} {3275#true} #63#return; {3275#true} is VALID [2018-11-23 11:52:00,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {3275#true} call #t~ret8 := main(); {3275#true} is VALID [2018-11-23 11:52:00,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {3275#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3306#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:00,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {3306#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3306#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:00,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {3306#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {3278#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3278#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {3278#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {3279#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3279#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {3279#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {3280#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3280#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {3280#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {3281#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3281#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {3281#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {3282#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3282#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {3282#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {3283#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3283#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {3283#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:00,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3284#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:00,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {3284#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:00,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {3285#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3285#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:00,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {3285#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:00,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {3286#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3286#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:00,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {3286#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3287#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:00,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {3287#(<= main_~a~0 10)} assume !(~a~0 < 100000); {3276#false} is VALID [2018-11-23 11:52:00,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {3276#false} havoc ~i~0;~i~0 := 0; {3276#false} is VALID [2018-11-23 11:52:00,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {3276#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3276#false} is VALID [2018-11-23 11:52:00,978 INFO L273 TraceCheckUtils]: 37: Hoare triple {3276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3276#false} is VALID [2018-11-23 11:52:00,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {3276#false} assume !(~i~0 < 100000); {3276#false} is VALID [2018-11-23 11:52:00,979 INFO L273 TraceCheckUtils]: 39: Hoare triple {3276#false} havoc ~x~0;~x~0 := 0; {3276#false} is VALID [2018-11-23 11:52:00,979 INFO L273 TraceCheckUtils]: 40: Hoare triple {3276#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3276#false} is VALID [2018-11-23 11:52:00,980 INFO L256 TraceCheckUtils]: 41: Hoare triple {3276#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3276#false} is VALID [2018-11-23 11:52:00,980 INFO L273 TraceCheckUtils]: 42: Hoare triple {3276#false} ~cond := #in~cond; {3276#false} is VALID [2018-11-23 11:52:00,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {3276#false} assume 0 == ~cond; {3276#false} is VALID [2018-11-23 11:52:00,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {3276#false} assume !false; {3276#false} is VALID [2018-11-23 11:52:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:52:01,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:01,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:52:01,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:52:01,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:01,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:01,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:01,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:01,062 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2018-11-23 11:52:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,427 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 11:52:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:01,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-23 11:52:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2018-11-23 11:52:01,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2018-11-23 11:52:01,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 62 transitions. [2018-11-23 11:52:01,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:01,490 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:52:01,490 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:52:01,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 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 11:52:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:52:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 11:52:01,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:01,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 11:52:01,512 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 11:52:01,512 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 11:52:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,513 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 11:52:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 11:52:01,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:01,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:01,514 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 11:52:01,514 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 11:52:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,516 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 11:52:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 11:52:01,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:01,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:01,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:01,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:52:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 11:52:01,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 45 [2018-11-23 11:52:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:01,518 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 11:52:01,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 11:52:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:52:01,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:01,519 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:01,519 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:01,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843590, now seen corresponding path program 11 times [2018-11-23 11:52:01,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:01,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:01,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:01,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {3716#true} call ULTIMATE.init(); {3716#true} is VALID [2018-11-23 11:52:01,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {3716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3716#true} is VALID [2018-11-23 11:52:01,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {3716#true} assume true; {3716#true} is VALID [2018-11-23 11:52:01,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3716#true} {3716#true} #63#return; {3716#true} is VALID [2018-11-23 11:52:01,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {3716#true} call #t~ret8 := main(); {3716#true} is VALID [2018-11-23 11:52:01,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {3716#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3718#(= main_~a~0 0)} is VALID [2018-11-23 11:52:01,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {3718#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3718#(= main_~a~0 0)} is VALID [2018-11-23 11:52:01,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {3718#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3719#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:01,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {3719#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3719#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:01,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {3719#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3720#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:01,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {3720#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3720#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:01,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {3720#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3721#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:01,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {3721#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3721#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:01,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {3721#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3722#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:01,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {3722#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3722#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:01,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {3722#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3723#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:01,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {3723#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3723#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:01,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {3723#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3724#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:01,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {3724#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3724#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:01,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {3724#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3725#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:01,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {3725#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3725#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:01,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {3725#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3726#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:01,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {3726#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3726#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:01,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {3726#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3727#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:01,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {3727#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3727#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:01,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {3727#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3728#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:01,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {3728#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3728#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:01,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {3728#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3729#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:01,987 INFO L273 TraceCheckUtils]: 28: Hoare triple {3729#(<= main_~a~0 11)} assume !(~a~0 < 100000); {3717#false} is VALID [2018-11-23 11:52:01,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {3717#false} havoc ~i~0;~i~0 := 0; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 30: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {3717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {3717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {3717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 36: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3717#false} is VALID [2018-11-23 11:52:01,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {3717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3717#false} is VALID [2018-11-23 11:52:01,989 INFO L273 TraceCheckUtils]: 38: Hoare triple {3717#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3717#false} is VALID [2018-11-23 11:52:01,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {3717#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3717#false} is VALID [2018-11-23 11:52:01,989 INFO L273 TraceCheckUtils]: 40: Hoare triple {3717#false} assume !(~i~0 < 100000); {3717#false} is VALID [2018-11-23 11:52:01,989 INFO L273 TraceCheckUtils]: 41: Hoare triple {3717#false} havoc ~x~0;~x~0 := 0; {3717#false} is VALID [2018-11-23 11:52:01,989 INFO L273 TraceCheckUtils]: 42: Hoare triple {3717#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3717#false} is VALID [2018-11-23 11:52:01,989 INFO L256 TraceCheckUtils]: 43: Hoare triple {3717#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3717#false} is VALID [2018-11-23 11:52:01,990 INFO L273 TraceCheckUtils]: 44: Hoare triple {3717#false} ~cond := #in~cond; {3717#false} is VALID [2018-11-23 11:52:01,990 INFO L273 TraceCheckUtils]: 45: Hoare triple {3717#false} assume 0 == ~cond; {3717#false} is VALID [2018-11-23 11:52:01,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {3717#false} assume !false; {3717#false} is VALID [2018-11-23 11:52:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 11:52:01,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:01,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:02,344 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:52:02,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:02,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {3716#true} call ULTIMATE.init(); {3716#true} is VALID [2018-11-23 11:52:02,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {3716#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3716#true} is VALID [2018-11-23 11:52:02,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {3716#true} assume true; {3716#true} is VALID [2018-11-23 11:52:02,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3716#true} {3716#true} #63#return; {3716#true} is VALID [2018-11-23 11:52:02,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {3716#true} call #t~ret8 := main(); {3716#true} is VALID [2018-11-23 11:52:02,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {3716#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3716#true} is VALID [2018-11-23 11:52:02,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {3716#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3716#true} is VALID [2018-11-23 11:52:02,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {3716#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3716#true} is VALID [2018-11-23 11:52:02,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {3716#true} assume !(~a~0 < 100000); {3716#true} is VALID [2018-11-23 11:52:02,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {3716#true} havoc ~i~0;~i~0 := 0; {3820#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:02,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {3820#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3820#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:02,549 INFO L273 TraceCheckUtils]: 31: Hoare triple {3820#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3827#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:02,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {3827#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3827#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:02,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {3827#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3834#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:02,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {3834#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3834#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:02,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {3834#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3841#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:02,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {3841#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3841#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:02,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {3841#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3848#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:02,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {3848#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3848#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:02,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {3848#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3855#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:02,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {3855#(<= main_~i~0 5)} assume !(~i~0 < 100000); {3717#false} is VALID [2018-11-23 11:52:02,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {3717#false} havoc ~x~0;~x~0 := 0; {3717#false} is VALID [2018-11-23 11:52:02,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {3717#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {3717#false} is VALID [2018-11-23 11:52:02,555 INFO L256 TraceCheckUtils]: 43: Hoare triple {3717#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3717#false} is VALID [2018-11-23 11:52:02,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {3717#false} ~cond := #in~cond; {3717#false} is VALID [2018-11-23 11:52:02,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {3717#false} assume 0 == ~cond; {3717#false} is VALID [2018-11-23 11:52:02,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {3717#false} assume !false; {3717#false} is VALID [2018-11-23 11:52:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:52:02,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:02,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-23 11:52:02,580 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:52:02,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:02,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:02,661 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 11:52:02,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:02,663 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 20 states. [2018-11-23 11:52:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,208 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-11-23 11:52:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:03,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:52:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2018-11-23 11:52:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2018-11-23 11:52:03,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2018-11-23 11:52:03,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:03,333 INFO L225 Difference]: With dead ends: 81 [2018-11-23 11:52:03,333 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 11:52:03,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 11:52:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 11:52:03,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:03,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 11:52:03,425 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 11:52:03,425 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 11:52:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,426 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:52:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:52:03,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,427 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 11:52:03,427 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 11:52:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,428 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 11:52:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 11:52:03,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:03,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:52:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 11:52:03,431 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 47 [2018-11-23 11:52:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:03,431 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 11:52:03,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 11:52:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:52:03,431 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:03,432 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:03,432 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:03,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:03,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1228141758, now seen corresponding path program 12 times [2018-11-23 11:52:03,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:03,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-23 11:52:04,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-23 11:52:04,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-23 11:52:04,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #63#return; {4192#true} is VALID [2018-11-23 11:52:04,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret8 := main(); {4192#true} is VALID [2018-11-23 11:52:04,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4194#(= main_~a~0 0)} is VALID [2018-11-23 11:52:04,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {4194#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4194#(= main_~a~0 0)} is VALID [2018-11-23 11:52:04,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {4194#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4195#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4195#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4196#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4196#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4197#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4197#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4198#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4198#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4199#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4199#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,320 INFO L273 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4200#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4200#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4201#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4201#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4202#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4202#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4203#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:04,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {4203#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4203#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:04,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {4203#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4204#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:04,326 INFO L273 TraceCheckUtils]: 26: Hoare triple {4204#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4204#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:04,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {4204#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4205#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:04,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {4205#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4205#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:04,327 INFO L273 TraceCheckUtils]: 29: Hoare triple {4205#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4206#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:04,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {4206#(<= main_~a~0 12)} assume !(~a~0 < 100000); {4193#false} is VALID [2018-11-23 11:52:04,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {4193#false} havoc ~i~0;~i~0 := 0; {4193#false} is VALID [2018-11-23 11:52:04,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-23 11:52:04,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-23 11:52:04,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-23 11:52:04,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-23 11:52:04,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-23 11:52:04,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-23 11:52:04,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-23 11:52:04,329 INFO L273 TraceCheckUtils]: 39: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-23 11:52:04,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-23 11:52:04,330 INFO L273 TraceCheckUtils]: 41: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-23 11:52:04,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4193#false} is VALID [2018-11-23 11:52:04,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {4193#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4193#false} is VALID [2018-11-23 11:52:04,330 INFO L273 TraceCheckUtils]: 44: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-23 11:52:04,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-23 11:52:04,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4193#false} is VALID [2018-11-23 11:52:04,331 INFO L256 TraceCheckUtils]: 47: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4193#false} is VALID [2018-11-23 11:52:04,331 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-23 11:52:04,331 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2018-11-23 11:52:04,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-23 11:52:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:52:04,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:04,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:04,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:07,334 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:52:07,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:07,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:07,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-23 11:52:07,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-23 11:52:07,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-23 11:52:07,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #63#return; {4192#true} is VALID [2018-11-23 11:52:07,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret8 := main(); {4192#true} is VALID [2018-11-23 11:52:07,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4192#true} is VALID [2018-11-23 11:52:07,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {4192#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4192#true} is VALID [2018-11-23 11:52:07,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {4192#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4192#true} is VALID [2018-11-23 11:52:07,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {4192#true} assume !(~a~0 < 100000); {4192#true} is VALID [2018-11-23 11:52:07,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {4192#true} havoc ~i~0;~i~0 := 0; {4303#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:07,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {4303#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4303#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:07,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {4303#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4310#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {4310#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4310#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:07,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {4310#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4317#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,553 INFO L273 TraceCheckUtils]: 36: Hoare triple {4317#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4317#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:07,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {4317#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4324#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {4324#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4324#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:07,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {4324#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4331#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {4331#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4331#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:07,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {4331#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4338#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {4338#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4338#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:07,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {4338#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4345#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:07,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {4345#(<= main_~i~0 6)} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-23 11:52:07,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-23 11:52:07,557 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4193#false} is VALID [2018-11-23 11:52:07,558 INFO L256 TraceCheckUtils]: 47: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4193#false} is VALID [2018-11-23 11:52:07,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-23 11:52:07,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2018-11-23 11:52:07,558 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-23 11:52:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-23 11:52:07,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 11:52:07,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:07,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:52:07,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:07,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:52:07,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:52:07,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:52:07,641 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 22 states. [2018-11-23 11:52:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,281 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-11-23 11:52:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:52:08,282 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 11:52:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2018-11-23 11:52:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2018-11-23 11:52:08,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 81 transitions. [2018-11-23 11:52:08,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:08,740 INFO L225 Difference]: With dead ends: 87 [2018-11-23 11:52:08,741 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:52:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:52:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:52:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-23 11:52:08,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:08,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 60 states. [2018-11-23 11:52:08,768 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 60 states. [2018-11-23 11:52:08,768 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 60 states. [2018-11-23 11:52:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,770 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 11:52:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:52:08,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:08,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:08,771 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 62 states. [2018-11-23 11:52:08,771 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 62 states. [2018-11-23 11:52:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,773 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 11:52:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:52:08,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:08,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:08,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:08,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:52:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-23 11:52:08,775 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 51 [2018-11-23 11:52:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:08,775 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 11:52:08,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:52:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 11:52:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:52:08,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:08,776 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:08,777 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:08,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash -119158338, now seen corresponding path program 13 times [2018-11-23 11:52:08,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:08,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:09,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {4705#true} call ULTIMATE.init(); {4705#true} is VALID [2018-11-23 11:52:09,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {4705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4705#true} is VALID [2018-11-23 11:52:09,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {4705#true} assume true; {4705#true} is VALID [2018-11-23 11:52:09,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4705#true} {4705#true} #63#return; {4705#true} is VALID [2018-11-23 11:52:09,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {4705#true} call #t~ret8 := main(); {4705#true} is VALID [2018-11-23 11:52:09,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {4705#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4707#(= main_~a~0 0)} is VALID [2018-11-23 11:52:09,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {4707#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4707#(= main_~a~0 0)} is VALID [2018-11-23 11:52:09,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {4707#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4708#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:09,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {4708#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4708#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:09,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {4708#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4709#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:09,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {4709#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4709#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:09,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {4709#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4710#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:09,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {4710#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4710#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:09,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {4710#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4711#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:09,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {4711#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4711#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:09,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {4711#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4712#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:09,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {4712#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4712#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:09,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {4712#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4713#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:09,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {4713#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4713#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:09,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {4713#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4714#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:09,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {4714#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4714#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:09,113 INFO L273 TraceCheckUtils]: 21: Hoare triple {4714#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4715#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:09,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {4715#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4715#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:09,114 INFO L273 TraceCheckUtils]: 23: Hoare triple {4715#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4716#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:09,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {4716#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4716#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:09,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {4716#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4717#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:09,116 INFO L273 TraceCheckUtils]: 26: Hoare triple {4717#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4717#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:09,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {4717#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4718#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:09,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {4718#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4718#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:09,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {4718#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4719#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:09,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {4719#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4719#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:09,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {4719#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4720#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:09,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {4720#(<= main_~a~0 13)} assume !(~a~0 < 100000); {4706#false} is VALID [2018-11-23 11:52:09,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {4706#false} havoc ~i~0;~i~0 := 0; {4706#false} is VALID [2018-11-23 11:52:09,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,121 INFO L273 TraceCheckUtils]: 37: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,122 INFO L273 TraceCheckUtils]: 38: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,122 INFO L273 TraceCheckUtils]: 39: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,123 INFO L273 TraceCheckUtils]: 42: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,124 INFO L273 TraceCheckUtils]: 47: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {4706#false} assume !(~i~0 < 100000); {4706#false} is VALID [2018-11-23 11:52:09,124 INFO L273 TraceCheckUtils]: 49: Hoare triple {4706#false} havoc ~x~0;~x~0 := 0; {4706#false} is VALID [2018-11-23 11:52:09,124 INFO L273 TraceCheckUtils]: 50: Hoare triple {4706#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4706#false} is VALID [2018-11-23 11:52:09,124 INFO L256 TraceCheckUtils]: 51: Hoare triple {4706#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4706#false} is VALID [2018-11-23 11:52:09,125 INFO L273 TraceCheckUtils]: 52: Hoare triple {4706#false} ~cond := #in~cond; {4706#false} is VALID [2018-11-23 11:52:09,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {4706#false} assume 0 == ~cond; {4706#false} is VALID [2018-11-23 11:52:09,125 INFO L273 TraceCheckUtils]: 54: Hoare triple {4706#false} assume !false; {4706#false} is VALID [2018-11-23 11:52:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:52:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:09,127 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:09,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:09,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {4705#true} call ULTIMATE.init(); {4705#true} is VALID [2018-11-23 11:52:09,303 INFO L273 TraceCheckUtils]: 1: Hoare triple {4705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4705#true} is VALID [2018-11-23 11:52:09,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {4705#true} assume true; {4705#true} is VALID [2018-11-23 11:52:09,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4705#true} {4705#true} #63#return; {4705#true} is VALID [2018-11-23 11:52:09,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {4705#true} call #t~ret8 := main(); {4705#true} is VALID [2018-11-23 11:52:09,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {4705#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4739#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:09,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {4739#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4739#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:09,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {4739#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4708#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:09,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {4708#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4708#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:09,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {4708#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4709#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:09,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {4709#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4709#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:09,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {4709#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4710#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:09,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {4710#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4710#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:09,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {4710#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4711#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:09,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {4711#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4711#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:09,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {4711#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4712#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:09,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {4712#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4712#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {4712#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4713#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {4713#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4713#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 19: Hoare triple {4713#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4714#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {4714#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4714#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {4714#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4715#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {4715#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4715#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {4715#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4716#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {4716#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4716#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:09,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {4716#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4717#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:09,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {4717#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4717#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:09,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {4717#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4718#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:09,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {4718#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4718#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:09,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {4718#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4719#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:09,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {4719#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4719#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:09,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {4719#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4720#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:09,322 INFO L273 TraceCheckUtils]: 32: Hoare triple {4720#(<= main_~a~0 13)} assume !(~a~0 < 100000); {4706#false} is VALID [2018-11-23 11:52:09,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {4706#false} havoc ~i~0;~i~0 := 0; {4706#false} is VALID [2018-11-23 11:52:09,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,323 INFO L273 TraceCheckUtils]: 36: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,324 INFO L273 TraceCheckUtils]: 37: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {4706#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4706#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {4706#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 48: Hoare triple {4706#false} assume !(~i~0 < 100000); {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {4706#false} havoc ~x~0;~x~0 := 0; {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 50: Hoare triple {4706#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L256 TraceCheckUtils]: 51: Hoare triple {4706#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 52: Hoare triple {4706#false} ~cond := #in~cond; {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 53: Hoare triple {4706#false} assume 0 == ~cond; {4706#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 54: Hoare triple {4706#false} assume !false; {4706#false} is VALID [2018-11-23 11:52:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:52:09,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:09,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:52:09,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:52:09,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:09,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:52:09,399 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 11:52:09,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:52:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:52:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:09,400 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 17 states. [2018-11-23 11:52:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,944 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 11:52:09,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:52:09,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:52:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 68 transitions. [2018-11-23 11:52:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 68 transitions. [2018-11-23 11:52:09,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 68 transitions. [2018-11-23 11:52:10,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:10,424 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:52:10,424 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:52:10,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:52:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 11:52:10,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:10,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-23 11:52:10,450 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-23 11:52:10,450 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-23 11:52:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,452 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 11:52:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 11:52:10,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:10,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:10,453 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-23 11:52:10,453 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-23 11:52:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,455 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 11:52:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 11:52:10,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:10,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:10,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:10,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:52:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 11:52:10,457 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 55 [2018-11-23 11:52:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:10,458 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 11:52:10,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:52:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 11:52:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:52:10,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:10,459 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:10,459 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:10,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1939154468, now seen corresponding path program 14 times [2018-11-23 11:52:10,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:10,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:10,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:11,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {5235#true} call ULTIMATE.init(); {5235#true} is VALID [2018-11-23 11:52:11,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {5235#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5235#true} is VALID [2018-11-23 11:52:11,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-23 11:52:11,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5235#true} {5235#true} #63#return; {5235#true} is VALID [2018-11-23 11:52:11,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {5235#true} call #t~ret8 := main(); {5235#true} is VALID [2018-11-23 11:52:11,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {5235#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5237#(= main_~a~0 0)} is VALID [2018-11-23 11:52:11,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {5237#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5237#(= main_~a~0 0)} is VALID [2018-11-23 11:52:11,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {5237#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5238#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {5238#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5238#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {5238#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5239#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {5239#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5239#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {5239#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5240#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {5240#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5240#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {5240#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5241#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {5241#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5241#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {5241#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5242#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {5242#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5242#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {5242#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5243#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {5243#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5243#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {5243#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5244#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {5244#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5244#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {5244#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5245#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {5245#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5245#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {5245#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5246#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {5246#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5246#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {5246#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5247#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {5247#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5247#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {5247#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5248#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:11,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {5248#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5248#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:11,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {5248#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:11,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {5249#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:11,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {5249#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5250#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:11,933 INFO L273 TraceCheckUtils]: 32: Hoare triple {5250#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5250#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:11,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {5250#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5251#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:11,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {5251#(<= main_~a~0 14)} assume !(~a~0 < 100000); {5236#false} is VALID [2018-11-23 11:52:11,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {5236#false} havoc ~i~0;~i~0 := 0; {5236#false} is VALID [2018-11-23 11:52:11,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,935 INFO L273 TraceCheckUtils]: 40: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,936 INFO L273 TraceCheckUtils]: 42: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,936 INFO L273 TraceCheckUtils]: 44: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,936 INFO L273 TraceCheckUtils]: 46: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,936 INFO L273 TraceCheckUtils]: 47: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 48: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 49: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 50: Hoare triple {5236#false} assume !(~i~0 < 100000); {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 51: Hoare triple {5236#false} havoc ~x~0;~x~0 := 0; {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {5236#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L256 TraceCheckUtils]: 53: Hoare triple {5236#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 54: Hoare triple {5236#false} ~cond := #in~cond; {5236#false} is VALID [2018-11-23 11:52:11,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {5236#false} assume 0 == ~cond; {5236#false} is VALID [2018-11-23 11:52:11,938 INFO L273 TraceCheckUtils]: 56: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2018-11-23 11:52:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:52:11,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:11,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:11,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:11,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:11,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:11,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:12,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {5235#true} call ULTIMATE.init(); {5235#true} is VALID [2018-11-23 11:52:12,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {5235#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5235#true} is VALID [2018-11-23 11:52:12,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-23 11:52:12,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5235#true} {5235#true} #63#return; {5235#true} is VALID [2018-11-23 11:52:12,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {5235#true} call #t~ret8 := main(); {5235#true} is VALID [2018-11-23 11:52:12,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {5235#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5270#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:12,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {5270#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5270#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:12,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {5270#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5238#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:12,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {5238#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5238#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:12,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {5238#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5239#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:12,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {5239#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5239#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:12,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {5239#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5240#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:12,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {5240#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5240#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:12,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {5240#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5241#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:12,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {5241#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5241#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:12,141 INFO L273 TraceCheckUtils]: 15: Hoare triple {5241#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5242#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:12,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {5242#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5242#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:12,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {5242#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5243#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:12,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {5243#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5243#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:12,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {5243#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5244#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:12,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {5244#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5244#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:12,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {5244#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5245#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:12,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {5245#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5245#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:12,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {5245#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5246#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:12,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {5246#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5246#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:12,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {5246#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5247#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:12,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {5247#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5247#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:12,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {5247#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5248#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:12,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {5248#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5248#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:12,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {5248#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5249#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:12,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {5249#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5249#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:12,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {5249#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5250#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:12,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {5250#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5250#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:12,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {5250#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5251#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:12,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {5251#(<= main_~a~0 14)} assume !(~a~0 < 100000); {5236#false} is VALID [2018-11-23 11:52:12,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {5236#false} havoc ~i~0;~i~0 := 0; {5236#false} is VALID [2018-11-23 11:52:12,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,155 INFO L273 TraceCheckUtils]: 37: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,156 INFO L273 TraceCheckUtils]: 38: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,156 INFO L273 TraceCheckUtils]: 39: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,156 INFO L273 TraceCheckUtils]: 42: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,157 INFO L273 TraceCheckUtils]: 43: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,157 INFO L273 TraceCheckUtils]: 45: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,157 INFO L273 TraceCheckUtils]: 47: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {5236#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 49: Hoare triple {5236#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {5236#false} assume !(~i~0 < 100000); {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {5236#false} havoc ~x~0;~x~0 := 0; {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {5236#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L256 TraceCheckUtils]: 53: Hoare triple {5236#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {5236#false} ~cond := #in~cond; {5236#false} is VALID [2018-11-23 11:52:12,158 INFO L273 TraceCheckUtils]: 55: Hoare triple {5236#false} assume 0 == ~cond; {5236#false} is VALID [2018-11-23 11:52:12,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2018-11-23 11:52:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:52:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:52:12,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-11-23 11:52:12,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:12,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:12,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:12,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:12,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:12,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:12,231 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 18 states. [2018-11-23 11:52:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,468 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:52:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:12,469 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-11-23 11:52:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 11:52:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 11:52:12,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2018-11-23 11:52:12,581 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 11:52:12,583 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:52:12,583 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:52:12,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:52:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 11:52:12,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:12,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2018-11-23 11:52:12,641 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2018-11-23 11:52:12,641 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2018-11-23 11:52:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,642 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 11:52:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 11:52:12,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,644 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2018-11-23 11:52:12,644 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2018-11-23 11:52:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,646 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 11:52:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 11:52:12,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:12,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 11:52:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 11:52:12,648 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2018-11-23 11:52:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:12,649 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 11:52:12,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 11:52:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:52:12,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:12,650 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:12,650 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:12,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1391221370, now seen corresponding path program 15 times [2018-11-23 11:52:12,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:12,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:12,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:13,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {5782#true} call ULTIMATE.init(); {5782#true} is VALID [2018-11-23 11:52:13,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {5782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5782#true} is VALID [2018-11-23 11:52:13,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {5782#true} assume true; {5782#true} is VALID [2018-11-23 11:52:13,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5782#true} {5782#true} #63#return; {5782#true} is VALID [2018-11-23 11:52:13,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {5782#true} call #t~ret8 := main(); {5782#true} is VALID [2018-11-23 11:52:13,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {5782#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5784#(= main_~a~0 0)} is VALID [2018-11-23 11:52:13,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {5784#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5784#(= main_~a~0 0)} is VALID [2018-11-23 11:52:13,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {5784#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5785#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:13,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {5785#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5785#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:13,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {5785#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5786#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:13,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {5786#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5786#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:13,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {5786#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5787#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:13,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {5787#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5787#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:13,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {5787#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5788#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:13,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {5788#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5788#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:13,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {5788#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5789#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:13,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {5789#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5789#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:13,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {5789#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5790#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:13,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {5790#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5790#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {5790#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5791#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:13,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {5791#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5791#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:13,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {5791#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5792#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {5792#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5792#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:13,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {5792#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5793#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:13,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {5793#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5793#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {5793#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5794#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:13,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {5794#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5794#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:13,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {5794#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5795#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {5795#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5795#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:13,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {5795#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5796#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:13,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {5796#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5796#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {5796#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5797#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:13,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {5797#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5797#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:13,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {5797#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5798#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {5798#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5798#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:13,591 INFO L273 TraceCheckUtils]: 35: Hoare triple {5798#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5799#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:13,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {5799#(<= main_~a~0 15)} assume !(~a~0 < 100000); {5783#false} is VALID [2018-11-23 11:52:13,592 INFO L273 TraceCheckUtils]: 37: Hoare triple {5783#false} havoc ~i~0;~i~0 := 0; {5783#false} is VALID [2018-11-23 11:52:13,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,593 INFO L273 TraceCheckUtils]: 39: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,593 INFO L273 TraceCheckUtils]: 41: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,593 INFO L273 TraceCheckUtils]: 42: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,593 INFO L273 TraceCheckUtils]: 43: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,594 INFO L273 TraceCheckUtils]: 44: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,594 INFO L273 TraceCheckUtils]: 45: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,594 INFO L273 TraceCheckUtils]: 46: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,594 INFO L273 TraceCheckUtils]: 47: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,595 INFO L273 TraceCheckUtils]: 49: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,595 INFO L273 TraceCheckUtils]: 50: Hoare triple {5783#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5783#false} is VALID [2018-11-23 11:52:13,595 INFO L273 TraceCheckUtils]: 51: Hoare triple {5783#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5783#false} is VALID [2018-11-23 11:52:13,595 INFO L273 TraceCheckUtils]: 52: Hoare triple {5783#false} assume !(~i~0 < 100000); {5783#false} is VALID [2018-11-23 11:52:13,596 INFO L273 TraceCheckUtils]: 53: Hoare triple {5783#false} havoc ~x~0;~x~0 := 0; {5783#false} is VALID [2018-11-23 11:52:13,596 INFO L273 TraceCheckUtils]: 54: Hoare triple {5783#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5783#false} is VALID [2018-11-23 11:52:13,596 INFO L256 TraceCheckUtils]: 55: Hoare triple {5783#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5783#false} is VALID [2018-11-23 11:52:13,596 INFO L273 TraceCheckUtils]: 56: Hoare triple {5783#false} ~cond := #in~cond; {5783#false} is VALID [2018-11-23 11:52:13,596 INFO L273 TraceCheckUtils]: 57: Hoare triple {5783#false} assume 0 == ~cond; {5783#false} is VALID [2018-11-23 11:52:13,596 INFO L273 TraceCheckUtils]: 58: Hoare triple {5783#false} assume !false; {5783#false} is VALID [2018-11-23 11:52:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 11:52:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:13,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:13,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:13,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 11:52:13,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:13,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:14,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {5782#true} call ULTIMATE.init(); {5782#true} is VALID [2018-11-23 11:52:14,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {5782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5782#true} is VALID [2018-11-23 11:52:14,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {5782#true} assume true; {5782#true} is VALID [2018-11-23 11:52:14,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5782#true} {5782#true} #63#return; {5782#true} is VALID [2018-11-23 11:52:14,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {5782#true} call #t~ret8 := main(); {5782#true} is VALID [2018-11-23 11:52:14,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {5782#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5782#true} is VALID [2018-11-23 11:52:14,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 31: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {5782#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {5782#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5782#true} is VALID [2018-11-23 11:52:14,146 INFO L273 TraceCheckUtils]: 36: Hoare triple {5782#true} assume !(~a~0 < 100000); {5782#true} is VALID [2018-11-23 11:52:14,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {5782#true} havoc ~i~0;~i~0 := 0; {5914#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:14,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {5914#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5914#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:14,148 INFO L273 TraceCheckUtils]: 39: Hoare triple {5914#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5921#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:14,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {5921#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5921#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:14,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {5921#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5928#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:14,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {5928#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5928#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:14,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {5928#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5935#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:14,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {5935#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5935#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:14,150 INFO L273 TraceCheckUtils]: 45: Hoare triple {5935#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5942#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:14,150 INFO L273 TraceCheckUtils]: 46: Hoare triple {5942#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5942#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:14,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {5942#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5949#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:14,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {5949#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5949#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:14,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {5949#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5956#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:14,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {5956#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5956#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:14,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {5956#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5963#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:14,154 INFO L273 TraceCheckUtils]: 52: Hoare triple {5963#(<= main_~i~0 7)} assume !(~i~0 < 100000); {5783#false} is VALID [2018-11-23 11:52:14,154 INFO L273 TraceCheckUtils]: 53: Hoare triple {5783#false} havoc ~x~0;~x~0 := 0; {5783#false} is VALID [2018-11-23 11:52:14,154 INFO L273 TraceCheckUtils]: 54: Hoare triple {5783#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5783#false} is VALID [2018-11-23 11:52:14,155 INFO L256 TraceCheckUtils]: 55: Hoare triple {5783#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5783#false} is VALID [2018-11-23 11:52:14,155 INFO L273 TraceCheckUtils]: 56: Hoare triple {5783#false} ~cond := #in~cond; {5783#false} is VALID [2018-11-23 11:52:14,155 INFO L273 TraceCheckUtils]: 57: Hoare triple {5783#false} assume 0 == ~cond; {5783#false} is VALID [2018-11-23 11:52:14,155 INFO L273 TraceCheckUtils]: 58: Hoare triple {5783#false} assume !false; {5783#false} is VALID [2018-11-23 11:52:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-11-23 11:52:14,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:14,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 26 [2018-11-23 11:52:14,177 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 11:52:14,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:14,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:52:14,245 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 11:52:14,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:52:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:52:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:14,247 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 26 states. [2018-11-23 11:52:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:15,074 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-23 11:52:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:52:15,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-23 11:52:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 89 transitions. [2018-11-23 11:52:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 89 transitions. [2018-11-23 11:52:15,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 89 transitions. [2018-11-23 11:52:15,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:15,588 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:52:15,588 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:52:15,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:52:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-23 11:52:16,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:16,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2018-11-23 11:52:16,293 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2018-11-23 11:52:16,293 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2018-11-23 11:52:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,295 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 11:52:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 11:52:16,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,296 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2018-11-23 11:52:16,296 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2018-11-23 11:52:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,298 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 11:52:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 11:52:16,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:16,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:52:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-23 11:52:16,307 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 59 [2018-11-23 11:52:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:16,307 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 11:52:16,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:52:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 11:52:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:52:16,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:16,308 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:16,309 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:16,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash -42160906, now seen corresponding path program 16 times [2018-11-23 11:52:16,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {6366#true} call ULTIMATE.init(); {6366#true} is VALID [2018-11-23 11:52:17,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {6366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6366#true} is VALID [2018-11-23 11:52:17,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {6366#true} assume true; {6366#true} is VALID [2018-11-23 11:52:17,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6366#true} {6366#true} #63#return; {6366#true} is VALID [2018-11-23 11:52:17,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {6366#true} call #t~ret8 := main(); {6366#true} is VALID [2018-11-23 11:52:17,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {6366#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6368#(= main_~a~0 0)} is VALID [2018-11-23 11:52:17,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {6368#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6368#(= main_~a~0 0)} is VALID [2018-11-23 11:52:17,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {6368#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6369#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:17,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {6369#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6369#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:17,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {6369#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6370#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:17,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {6370#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6370#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:17,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {6370#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6371#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:17,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {6371#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6371#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:17,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {6371#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6372#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:17,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {6372#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6372#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:17,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {6372#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6373#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:17,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {6373#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6373#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:17,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {6373#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6374#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:17,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {6374#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6374#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:17,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {6374#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6375#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:17,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {6375#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6375#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:17,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {6375#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6376#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:17,276 INFO L273 TraceCheckUtils]: 22: Hoare triple {6376#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6376#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:17,276 INFO L273 TraceCheckUtils]: 23: Hoare triple {6376#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6377#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:17,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {6377#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6377#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:17,278 INFO L273 TraceCheckUtils]: 25: Hoare triple {6377#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6378#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:17,279 INFO L273 TraceCheckUtils]: 26: Hoare triple {6378#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6378#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:17,279 INFO L273 TraceCheckUtils]: 27: Hoare triple {6378#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6379#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:17,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {6379#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6379#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:17,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {6379#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6380#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:17,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {6380#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6380#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:17,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {6380#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6381#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:17,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {6381#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6381#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:17,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {6381#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6382#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:17,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {6382#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6382#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:17,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {6382#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6383#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:17,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {6383#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6383#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:17,287 INFO L273 TraceCheckUtils]: 37: Hoare triple {6383#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6384#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:17,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {6384#(<= main_~a~0 16)} assume !(~a~0 < 100000); {6367#false} is VALID [2018-11-23 11:52:17,288 INFO L273 TraceCheckUtils]: 39: Hoare triple {6367#false} havoc ~i~0;~i~0 := 0; {6367#false} is VALID [2018-11-23 11:52:17,288 INFO L273 TraceCheckUtils]: 40: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,289 INFO L273 TraceCheckUtils]: 41: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,289 INFO L273 TraceCheckUtils]: 42: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,290 INFO L273 TraceCheckUtils]: 45: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,290 INFO L273 TraceCheckUtils]: 47: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 50: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 51: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 52: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 53: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {6367#false} assume !(~i~0 < 100000); {6367#false} is VALID [2018-11-23 11:52:17,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {6367#false} havoc ~x~0;~x~0 := 0; {6367#false} is VALID [2018-11-23 11:52:17,292 INFO L273 TraceCheckUtils]: 58: Hoare triple {6367#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6367#false} is VALID [2018-11-23 11:52:17,292 INFO L256 TraceCheckUtils]: 59: Hoare triple {6367#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6367#false} is VALID [2018-11-23 11:52:17,292 INFO L273 TraceCheckUtils]: 60: Hoare triple {6367#false} ~cond := #in~cond; {6367#false} is VALID [2018-11-23 11:52:17,292 INFO L273 TraceCheckUtils]: 61: Hoare triple {6367#false} assume 0 == ~cond; {6367#false} is VALID [2018-11-23 11:52:17,292 INFO L273 TraceCheckUtils]: 62: Hoare triple {6367#false} assume !false; {6367#false} is VALID [2018-11-23 11:52:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:52:17,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:17,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:17,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:17,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:17,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:17,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {6366#true} call ULTIMATE.init(); {6366#true} is VALID [2018-11-23 11:52:17,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {6366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6366#true} is VALID [2018-11-23 11:52:17,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {6366#true} assume true; {6366#true} is VALID [2018-11-23 11:52:17,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6366#true} {6366#true} #63#return; {6366#true} is VALID [2018-11-23 11:52:17,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {6366#true} call #t~ret8 := main(); {6366#true} is VALID [2018-11-23 11:52:17,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {6366#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6403#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:17,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {6403#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6403#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:17,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {6403#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6369#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:17,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {6369#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6369#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:17,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {6369#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6370#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:17,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {6370#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6370#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:17,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {6370#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6371#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:17,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {6371#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6371#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:17,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {6371#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6372#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:17,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {6372#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6372#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:17,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {6372#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6373#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:17,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {6373#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6373#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:17,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {6373#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6374#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:17,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {6374#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6374#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:17,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {6374#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6375#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:17,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {6375#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6375#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:17,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {6375#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6376#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:17,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {6376#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6376#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:17,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {6376#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6377#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:17,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {6377#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6377#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:17,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {6377#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6378#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:17,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {6378#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6378#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:17,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {6378#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6379#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:17,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {6379#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6379#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:17,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {6379#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6380#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:17,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {6380#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6380#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:17,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {6380#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6381#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:17,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {6381#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6381#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:17,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {6381#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6382#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:17,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {6382#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6382#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:17,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {6382#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6383#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:17,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {6383#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6383#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:17,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {6383#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6384#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:17,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {6384#(<= main_~a~0 16)} assume !(~a~0 < 100000); {6367#false} is VALID [2018-11-23 11:52:17,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {6367#false} havoc ~i~0;~i~0 := 0; {6367#false} is VALID [2018-11-23 11:52:17,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,718 INFO L273 TraceCheckUtils]: 47: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,719 INFO L273 TraceCheckUtils]: 51: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,719 INFO L273 TraceCheckUtils]: 52: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,720 INFO L273 TraceCheckUtils]: 54: Hoare triple {6367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6367#false} is VALID [2018-11-23 11:52:17,720 INFO L273 TraceCheckUtils]: 55: Hoare triple {6367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6367#false} is VALID [2018-11-23 11:52:17,720 INFO L273 TraceCheckUtils]: 56: Hoare triple {6367#false} assume !(~i~0 < 100000); {6367#false} is VALID [2018-11-23 11:52:17,720 INFO L273 TraceCheckUtils]: 57: Hoare triple {6367#false} havoc ~x~0;~x~0 := 0; {6367#false} is VALID [2018-11-23 11:52:17,721 INFO L273 TraceCheckUtils]: 58: Hoare triple {6367#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6367#false} is VALID [2018-11-23 11:52:17,721 INFO L256 TraceCheckUtils]: 59: Hoare triple {6367#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6367#false} is VALID [2018-11-23 11:52:17,721 INFO L273 TraceCheckUtils]: 60: Hoare triple {6367#false} ~cond := #in~cond; {6367#false} is VALID [2018-11-23 11:52:17,721 INFO L273 TraceCheckUtils]: 61: Hoare triple {6367#false} assume 0 == ~cond; {6367#false} is VALID [2018-11-23 11:52:17,721 INFO L273 TraceCheckUtils]: 62: Hoare triple {6367#false} assume !false; {6367#false} is VALID [2018-11-23 11:52:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:52:17,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:17,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:52:17,744 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-11-23 11:52:17,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:17,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:17,798 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 11:52:17,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:17,799 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 20 states. [2018-11-23 11:52:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,188 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-11-23 11:52:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:18,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-11-23 11:52:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2018-11-23 11:52:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2018-11-23 11:52:18,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 74 transitions. [2018-11-23 11:52:18,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:18,269 INFO L225 Difference]: With dead ends: 100 [2018-11-23 11:52:18,269 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:52:18,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:52:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 11:52:18,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:18,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:18,337 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:18,337 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,339 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 11:52:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 11:52:18,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:18,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:18,340 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 11:52:18,340 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 11:52:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,342 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 11:52:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 11:52:18,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:18,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:18,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:18,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:52:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-23 11:52:18,344 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2018-11-23 11:52:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:18,344 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-23 11:52:18,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 11:52:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:52:18,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:18,345 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:18,345 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:18,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash -487145708, now seen corresponding path program 17 times [2018-11-23 11:52:18,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:18,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:18,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:18,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {6966#true} call ULTIMATE.init(); {6966#true} is VALID [2018-11-23 11:52:18,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {6966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6966#true} is VALID [2018-11-23 11:52:18,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:52:18,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6966#true} {6966#true} #63#return; {6966#true} is VALID [2018-11-23 11:52:18,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {6966#true} call #t~ret8 := main(); {6966#true} is VALID [2018-11-23 11:52:18,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {6966#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6968#(= main_~a~0 0)} is VALID [2018-11-23 11:52:18,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {6968#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6968#(= main_~a~0 0)} is VALID [2018-11-23 11:52:18,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {6968#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6969#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:18,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {6969#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6969#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:18,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {6969#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6970#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:18,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {6970#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6970#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:18,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {6970#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6971#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:18,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {6971#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6971#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:18,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {6971#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6972#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:18,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {6972#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6972#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:18,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {6972#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6973#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:18,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {6973#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6973#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:18,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {6973#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6974#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:18,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {6974#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6974#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:18,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {6974#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6975#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:18,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {6975#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6975#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:18,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {6975#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6976#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:18,824 INFO L273 TraceCheckUtils]: 22: Hoare triple {6976#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6976#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:18,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {6976#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6977#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:18,825 INFO L273 TraceCheckUtils]: 24: Hoare triple {6977#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6977#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:18,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {6977#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6978#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:18,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {6978#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6978#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:18,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {6978#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6979#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:18,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {6979#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6979#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:18,828 INFO L273 TraceCheckUtils]: 29: Hoare triple {6979#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6980#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:18,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {6980#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6980#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:18,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {6980#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6981#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:18,830 INFO L273 TraceCheckUtils]: 32: Hoare triple {6981#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6981#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:18,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {6981#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6982#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:18,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {6982#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6982#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:18,832 INFO L273 TraceCheckUtils]: 35: Hoare triple {6982#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6983#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:18,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {6983#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6983#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:18,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {6983#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6984#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:18,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {6984#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6984#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:18,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {6984#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6985#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:18,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {6985#(<= main_~a~0 17)} assume !(~a~0 < 100000); {6967#false} is VALID [2018-11-23 11:52:18,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {6967#false} havoc ~i~0;~i~0 := 0; {6967#false} is VALID [2018-11-23 11:52:18,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,837 INFO L273 TraceCheckUtils]: 47: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,837 INFO L273 TraceCheckUtils]: 48: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,837 INFO L273 TraceCheckUtils]: 50: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,838 INFO L273 TraceCheckUtils]: 51: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,838 INFO L273 TraceCheckUtils]: 52: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,838 INFO L273 TraceCheckUtils]: 53: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,838 INFO L273 TraceCheckUtils]: 54: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,838 INFO L273 TraceCheckUtils]: 55: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,839 INFO L273 TraceCheckUtils]: 56: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:18,839 INFO L273 TraceCheckUtils]: 57: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:18,839 INFO L273 TraceCheckUtils]: 58: Hoare triple {6967#false} assume !(~i~0 < 100000); {6967#false} is VALID [2018-11-23 11:52:18,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {6967#false} havoc ~x~0;~x~0 := 0; {6967#false} is VALID [2018-11-23 11:52:18,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {6967#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6967#false} is VALID [2018-11-23 11:52:18,839 INFO L256 TraceCheckUtils]: 61: Hoare triple {6967#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6967#false} is VALID [2018-11-23 11:52:18,840 INFO L273 TraceCheckUtils]: 62: Hoare triple {6967#false} ~cond := #in~cond; {6967#false} is VALID [2018-11-23 11:52:18,840 INFO L273 TraceCheckUtils]: 63: Hoare triple {6967#false} assume 0 == ~cond; {6967#false} is VALID [2018-11-23 11:52:18,840 INFO L273 TraceCheckUtils]: 64: Hoare triple {6967#false} assume !false; {6967#false} is VALID [2018-11-23 11:52:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:52:18,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:18,843 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:18,851 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:21,047 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:52:21,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:21,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:21,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {6966#true} call ULTIMATE.init(); {6966#true} is VALID [2018-11-23 11:52:21,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {6966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6966#true} is VALID [2018-11-23 11:52:21,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {6966#true} assume true; {6966#true} is VALID [2018-11-23 11:52:21,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6966#true} {6966#true} #63#return; {6966#true} is VALID [2018-11-23 11:52:21,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {6966#true} call #t~ret8 := main(); {6966#true} is VALID [2018-11-23 11:52:21,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {6966#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7004#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:21,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {7004#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7004#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:21,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {7004#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6969#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:21,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {6969#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6969#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:21,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {6969#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6970#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:21,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {6970#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6970#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:21,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {6970#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6971#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:21,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {6971#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6971#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:21,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {6971#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6972#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:21,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {6972#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6972#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:21,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {6972#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6973#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:21,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {6973#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6973#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:21,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {6973#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6974#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:21,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {6974#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6974#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:21,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {6974#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6975#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:21,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {6975#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6975#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:21,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {6975#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6976#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:21,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {6976#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6976#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:21,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {6976#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6977#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:21,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {6977#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6977#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:21,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {6977#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6978#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:21,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {6978#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6978#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:21,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {6978#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6979#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:21,265 INFO L273 TraceCheckUtils]: 28: Hoare triple {6979#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6979#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:21,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {6979#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6980#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:21,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {6980#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6980#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:21,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {6980#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6981#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:21,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {6981#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6981#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:21,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {6981#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6982#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:21,269 INFO L273 TraceCheckUtils]: 34: Hoare triple {6982#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6982#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:21,270 INFO L273 TraceCheckUtils]: 35: Hoare triple {6982#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6983#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:21,270 INFO L273 TraceCheckUtils]: 36: Hoare triple {6983#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6983#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:21,271 INFO L273 TraceCheckUtils]: 37: Hoare triple {6983#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6984#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:21,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {6984#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6984#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:21,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {6984#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6985#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:21,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {6985#(<= main_~a~0 17)} assume !(~a~0 < 100000); {6967#false} is VALID [2018-11-23 11:52:21,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {6967#false} havoc ~i~0;~i~0 := 0; {6967#false} is VALID [2018-11-23 11:52:21,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,274 INFO L273 TraceCheckUtils]: 45: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,274 INFO L273 TraceCheckUtils]: 46: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,274 INFO L273 TraceCheckUtils]: 47: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,274 INFO L273 TraceCheckUtils]: 48: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,275 INFO L273 TraceCheckUtils]: 49: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,275 INFO L273 TraceCheckUtils]: 50: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,275 INFO L273 TraceCheckUtils]: 51: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,275 INFO L273 TraceCheckUtils]: 52: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,275 INFO L273 TraceCheckUtils]: 53: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {6967#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {6967#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 58: Hoare triple {6967#false} assume !(~i~0 < 100000); {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 59: Hoare triple {6967#false} havoc ~x~0;~x~0 := 0; {6967#false} is VALID [2018-11-23 11:52:21,276 INFO L273 TraceCheckUtils]: 60: Hoare triple {6967#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {6967#false} is VALID [2018-11-23 11:52:21,277 INFO L256 TraceCheckUtils]: 61: Hoare triple {6967#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {6967#false} is VALID [2018-11-23 11:52:21,277 INFO L273 TraceCheckUtils]: 62: Hoare triple {6967#false} ~cond := #in~cond; {6967#false} is VALID [2018-11-23 11:52:21,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {6967#false} assume 0 == ~cond; {6967#false} is VALID [2018-11-23 11:52:21,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {6967#false} assume !false; {6967#false} is VALID [2018-11-23 11:52:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:52:21,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:21,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:52:21,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-23 11:52:21,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:21,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:52:21,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:21,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:52:21,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:52:21,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:21,359 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 21 states. [2018-11-23 11:52:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,719 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-23 11:52:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:21,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-11-23 11:52:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 76 transitions. [2018-11-23 11:52:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 76 transitions. [2018-11-23 11:52:21,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 76 transitions. [2018-11-23 11:52:21,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:21,799 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:52:21,799 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:52:21,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:52:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 11:52:21,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:21,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 11:52:21,834 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 11:52:21,835 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 11:52:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,836 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 11:52:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 11:52:21,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,837 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 11:52:21,837 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 11:52:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,839 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 11:52:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 11:52:21,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:21,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:52:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 11:52:21,841 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 65 [2018-11-23 11:52:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:21,841 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 11:52:21,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:52:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 11:52:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:52:21,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:21,842 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:21,843 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:21,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1379189170, now seen corresponding path program 18 times [2018-11-23 11:52:21,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:21,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:21,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:21,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {7583#true} call ULTIMATE.init(); {7583#true} is VALID [2018-11-23 11:52:22,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {7583#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7583#true} is VALID [2018-11-23 11:52:22,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {7583#true} assume true; {7583#true} is VALID [2018-11-23 11:52:22,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7583#true} {7583#true} #63#return; {7583#true} is VALID [2018-11-23 11:52:22,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {7583#true} call #t~ret8 := main(); {7583#true} is VALID [2018-11-23 11:52:22,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {7583#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7585#(= main_~a~0 0)} is VALID [2018-11-23 11:52:22,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {7585#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7585#(= main_~a~0 0)} is VALID [2018-11-23 11:52:22,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {7585#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7586#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:22,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {7586#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7586#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:22,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {7586#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7587#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:22,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {7587#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7587#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:22,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {7587#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7588#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:22,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {7588#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7588#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:22,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {7588#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7589#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:22,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {7589#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7589#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:22,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {7589#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7590#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:22,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {7590#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7590#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:22,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {7590#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7591#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:22,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {7591#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7591#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:22,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {7591#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7592#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:22,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {7592#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7592#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:22,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {7592#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7593#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:22,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {7593#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7593#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:22,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {7593#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7594#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:22,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {7594#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7594#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:22,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {7594#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7595#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:22,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {7595#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7595#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:22,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {7595#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7596#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:22,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {7596#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7596#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:22,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {7596#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7597#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:22,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {7597#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7597#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:22,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {7597#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7598#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:22,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {7598#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7598#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:22,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {7598#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7599#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:22,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {7599#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7599#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:22,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {7599#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7600#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:22,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {7600#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7600#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:22,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {7600#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7601#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:22,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {7601#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7601#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:22,436 INFO L273 TraceCheckUtils]: 39: Hoare triple {7601#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7602#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:22,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {7602#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7602#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:22,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {7602#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7603#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:22,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {7603#(<= main_~a~0 18)} assume !(~a~0 < 100000); {7584#false} is VALID [2018-11-23 11:52:22,438 INFO L273 TraceCheckUtils]: 43: Hoare triple {7584#false} havoc ~i~0;~i~0 := 0; {7584#false} is VALID [2018-11-23 11:52:22,438 INFO L273 TraceCheckUtils]: 44: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,439 INFO L273 TraceCheckUtils]: 46: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,439 INFO L273 TraceCheckUtils]: 47: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,440 INFO L273 TraceCheckUtils]: 51: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,440 INFO L273 TraceCheckUtils]: 52: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,440 INFO L273 TraceCheckUtils]: 53: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,440 INFO L273 TraceCheckUtils]: 54: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,440 INFO L273 TraceCheckUtils]: 56: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,441 INFO L273 TraceCheckUtils]: 57: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,441 INFO L273 TraceCheckUtils]: 58: Hoare triple {7584#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7584#false} is VALID [2018-11-23 11:52:22,441 INFO L273 TraceCheckUtils]: 59: Hoare triple {7584#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7584#false} is VALID [2018-11-23 11:52:22,441 INFO L273 TraceCheckUtils]: 60: Hoare triple {7584#false} assume !(~i~0 < 100000); {7584#false} is VALID [2018-11-23 11:52:22,441 INFO L273 TraceCheckUtils]: 61: Hoare triple {7584#false} havoc ~x~0;~x~0 := 0; {7584#false} is VALID [2018-11-23 11:52:22,442 INFO L273 TraceCheckUtils]: 62: Hoare triple {7584#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7584#false} is VALID [2018-11-23 11:52:22,442 INFO L256 TraceCheckUtils]: 63: Hoare triple {7584#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7584#false} is VALID [2018-11-23 11:52:22,442 INFO L273 TraceCheckUtils]: 64: Hoare triple {7584#false} ~cond := #in~cond; {7584#false} is VALID [2018-11-23 11:52:22,442 INFO L273 TraceCheckUtils]: 65: Hoare triple {7584#false} assume 0 == ~cond; {7584#false} is VALID [2018-11-23 11:52:22,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {7584#false} assume !false; {7584#false} is VALID [2018-11-23 11:52:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:52:22,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:22,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:22,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:40,828 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 11:52:40,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:40,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:41,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {7583#true} call ULTIMATE.init(); {7583#true} is VALID [2018-11-23 11:52:41,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {7583#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7583#true} is VALID [2018-11-23 11:52:41,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {7583#true} assume true; {7583#true} is VALID [2018-11-23 11:52:41,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7583#true} {7583#true} #63#return; {7583#true} is VALID [2018-11-23 11:52:41,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {7583#true} call #t~ret8 := main(); {7583#true} is VALID [2018-11-23 11:52:41,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {7583#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7583#true} is VALID [2018-11-23 11:52:41,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 29: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 30: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 31: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 32: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 33: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {7583#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {7583#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7583#true} is VALID [2018-11-23 11:52:41,206 INFO L273 TraceCheckUtils]: 42: Hoare triple {7583#true} assume !(~a~0 < 100000); {7583#true} is VALID [2018-11-23 11:52:41,207 INFO L273 TraceCheckUtils]: 43: Hoare triple {7583#true} havoc ~i~0;~i~0 := 0; {7736#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:41,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {7736#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7736#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:41,208 INFO L273 TraceCheckUtils]: 45: Hoare triple {7736#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7743#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:41,208 INFO L273 TraceCheckUtils]: 46: Hoare triple {7743#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7743#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:41,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {7743#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7750#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,209 INFO L273 TraceCheckUtils]: 48: Hoare triple {7750#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7750#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,209 INFO L273 TraceCheckUtils]: 49: Hoare triple {7750#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7757#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {7757#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7757#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {7757#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7764#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {7764#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7764#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,211 INFO L273 TraceCheckUtils]: 53: Hoare triple {7764#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7771#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {7771#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7771#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,212 INFO L273 TraceCheckUtils]: 55: Hoare triple {7771#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7778#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,213 INFO L273 TraceCheckUtils]: 56: Hoare triple {7778#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7778#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,213 INFO L273 TraceCheckUtils]: 57: Hoare triple {7778#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7785#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7785#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7792#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:41,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {7792#(<= main_~i~0 8)} assume !(~i~0 < 100000); {7584#false} is VALID [2018-11-23 11:52:41,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {7584#false} havoc ~x~0;~x~0 := 0; {7584#false} is VALID [2018-11-23 11:52:41,216 INFO L273 TraceCheckUtils]: 62: Hoare triple {7584#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {7584#false} is VALID [2018-11-23 11:52:41,216 INFO L256 TraceCheckUtils]: 63: Hoare triple {7584#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {7584#false} is VALID [2018-11-23 11:52:41,216 INFO L273 TraceCheckUtils]: 64: Hoare triple {7584#false} ~cond := #in~cond; {7584#false} is VALID [2018-11-23 11:52:41,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {7584#false} assume 0 == ~cond; {7584#false} is VALID [2018-11-23 11:52:41,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {7584#false} assume !false; {7584#false} is VALID [2018-11-23 11:52:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 11:52:41,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 30 [2018-11-23 11:52:41,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-23 11:52:41,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:41,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:52:41,319 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 11:52:41,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:52:41,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:52:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:41,321 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 30 states. [2018-11-23 11:52:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:41,962 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 11:52:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:52:41,962 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-23 11:52:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2018-11-23 11:52:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2018-11-23 11:52:41,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 97 transitions. [2018-11-23 11:52:42,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:42,069 INFO L225 Difference]: With dead ends: 107 [2018-11-23 11:52:42,069 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 11:52:42,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=606, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 11:52:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 11:52:42,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:42,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-23 11:52:42,097 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-23 11:52:42,097 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-23 11:52:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:42,098 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 11:52:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 11:52:42,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:42,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:42,100 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-23 11:52:42,100 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-23 11:52:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:42,101 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 11:52:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 11:52:42,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:42,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:42,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:42,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:52:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 11:52:42,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2018-11-23 11:52:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:42,104 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 11:52:42,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:52:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 11:52:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 11:52:42,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:42,105 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:42,105 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:42,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1593026606, now seen corresponding path program 19 times [2018-11-23 11:52:42,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:42,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:42,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {8238#true} call ULTIMATE.init(); {8238#true} is VALID [2018-11-23 11:52:42,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {8238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8238#true} is VALID [2018-11-23 11:52:42,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {8238#true} assume true; {8238#true} is VALID [2018-11-23 11:52:42,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8238#true} {8238#true} #63#return; {8238#true} is VALID [2018-11-23 11:52:42,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {8238#true} call #t~ret8 := main(); {8238#true} is VALID [2018-11-23 11:52:42,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {8238#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8240#(= main_~a~0 0)} is VALID [2018-11-23 11:52:42,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {8240#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8240#(= main_~a~0 0)} is VALID [2018-11-23 11:52:42,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {8240#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:42,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {8241#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8241#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:42,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {8241#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8242#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:42,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {8242#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8242#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:42,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {8242#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8243#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:42,562 INFO L273 TraceCheckUtils]: 12: Hoare triple {8243#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8243#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:42,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {8243#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8244#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:42,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {8244#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8244#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:42,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {8244#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8245#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:42,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {8245#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8245#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:42,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {8245#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8246#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:42,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {8246#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8246#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:42,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {8246#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8247#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:42,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {8247#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8247#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:42,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {8247#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8248#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:42,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {8248#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8248#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:42,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {8248#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8249#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:42,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {8249#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8249#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:42,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {8249#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8250#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:42,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {8250#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8250#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:42,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {8250#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8251#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:42,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {8251#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8251#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:42,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {8251#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8252#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:42,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {8252#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8252#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:42,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {8252#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8253#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:42,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {8253#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8253#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:42,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {8253#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8254#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:42,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {8254#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8254#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:42,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {8254#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8255#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:42,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {8255#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8255#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:42,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {8255#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8256#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:42,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {8256#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8256#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:42,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {8256#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8257#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:42,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {8257#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8257#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:42,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {8257#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8258#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:42,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {8258#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8258#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:42,582 INFO L273 TraceCheckUtils]: 43: Hoare triple {8258#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8259#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:42,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {8259#(<= main_~a~0 19)} assume !(~a~0 < 100000); {8239#false} is VALID [2018-11-23 11:52:42,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {8239#false} havoc ~i~0;~i~0 := 0; {8239#false} is VALID [2018-11-23 11:52:42,583 INFO L273 TraceCheckUtils]: 46: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,584 INFO L273 TraceCheckUtils]: 51: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,584 INFO L273 TraceCheckUtils]: 52: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 53: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 54: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 55: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 56: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 57: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 58: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,585 INFO L273 TraceCheckUtils]: 59: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 60: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 61: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 62: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 63: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 64: Hoare triple {8239#false} assume !(~i~0 < 100000); {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 65: Hoare triple {8239#false} havoc ~x~0;~x~0 := 0; {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L273 TraceCheckUtils]: 66: Hoare triple {8239#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8239#false} is VALID [2018-11-23 11:52:42,586 INFO L256 TraceCheckUtils]: 67: Hoare triple {8239#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8239#false} is VALID [2018-11-23 11:52:42,587 INFO L273 TraceCheckUtils]: 68: Hoare triple {8239#false} ~cond := #in~cond; {8239#false} is VALID [2018-11-23 11:52:42,587 INFO L273 TraceCheckUtils]: 69: Hoare triple {8239#false} assume 0 == ~cond; {8239#false} is VALID [2018-11-23 11:52:42,587 INFO L273 TraceCheckUtils]: 70: Hoare triple {8239#false} assume !false; {8239#false} is VALID [2018-11-23 11:52:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:42,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:42,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 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 11:52:42,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:42,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {8238#true} call ULTIMATE.init(); {8238#true} is VALID [2018-11-23 11:52:42,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {8238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8238#true} is VALID [2018-11-23 11:52:42,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {8238#true} assume true; {8238#true} is VALID [2018-11-23 11:52:42,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8238#true} {8238#true} #63#return; {8238#true} is VALID [2018-11-23 11:52:42,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {8238#true} call #t~ret8 := main(); {8238#true} is VALID [2018-11-23 11:52:42,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {8238#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8278#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:42,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {8278#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8278#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:42,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {8278#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8241#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:42,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {8241#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8241#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:42,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {8241#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8242#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:42,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {8242#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8242#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:42,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {8242#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8243#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:42,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {8243#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8243#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:42,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {8243#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8244#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:42,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {8244#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8244#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:42,875 INFO L273 TraceCheckUtils]: 15: Hoare triple {8244#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8245#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:42,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {8245#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8245#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:42,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {8245#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8246#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:42,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {8246#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8246#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:42,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {8246#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8247#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:42,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {8247#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8247#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:42,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {8247#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8248#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:42,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {8248#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8248#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:42,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {8248#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8249#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:42,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {8249#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8249#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:42,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {8249#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8250#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:42,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {8250#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8250#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:42,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {8250#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8251#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:42,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {8251#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8251#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:42,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {8251#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8252#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:42,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {8252#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8252#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:42,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {8252#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8253#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:42,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {8253#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8253#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:42,887 INFO L273 TraceCheckUtils]: 33: Hoare triple {8253#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8254#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:42,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {8254#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8254#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:42,888 INFO L273 TraceCheckUtils]: 35: Hoare triple {8254#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8255#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:42,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {8255#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8255#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:42,889 INFO L273 TraceCheckUtils]: 37: Hoare triple {8255#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8256#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:42,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {8256#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8256#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:42,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {8256#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8257#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:42,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {8257#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8257#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:42,892 INFO L273 TraceCheckUtils]: 41: Hoare triple {8257#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8258#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:42,892 INFO L273 TraceCheckUtils]: 42: Hoare triple {8258#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8258#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:42,893 INFO L273 TraceCheckUtils]: 43: Hoare triple {8258#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8259#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:42,894 INFO L273 TraceCheckUtils]: 44: Hoare triple {8259#(<= main_~a~0 19)} assume !(~a~0 < 100000); {8239#false} is VALID [2018-11-23 11:52:42,894 INFO L273 TraceCheckUtils]: 45: Hoare triple {8239#false} havoc ~i~0;~i~0 := 0; {8239#false} is VALID [2018-11-23 11:52:42,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,894 INFO L273 TraceCheckUtils]: 48: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,895 INFO L273 TraceCheckUtils]: 49: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,895 INFO L273 TraceCheckUtils]: 50: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,895 INFO L273 TraceCheckUtils]: 51: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,895 INFO L273 TraceCheckUtils]: 53: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,896 INFO L273 TraceCheckUtils]: 55: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,896 INFO L273 TraceCheckUtils]: 56: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,896 INFO L273 TraceCheckUtils]: 57: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,897 INFO L273 TraceCheckUtils]: 59: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,897 INFO L273 TraceCheckUtils]: 61: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,897 INFO L273 TraceCheckUtils]: 62: Hoare triple {8239#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8239#false} is VALID [2018-11-23 11:52:42,897 INFO L273 TraceCheckUtils]: 63: Hoare triple {8239#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8239#false} is VALID [2018-11-23 11:52:42,898 INFO L273 TraceCheckUtils]: 64: Hoare triple {8239#false} assume !(~i~0 < 100000); {8239#false} is VALID [2018-11-23 11:52:42,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {8239#false} havoc ~x~0;~x~0 := 0; {8239#false} is VALID [2018-11-23 11:52:42,898 INFO L273 TraceCheckUtils]: 66: Hoare triple {8239#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8239#false} is VALID [2018-11-23 11:52:42,898 INFO L256 TraceCheckUtils]: 67: Hoare triple {8239#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8239#false} is VALID [2018-11-23 11:52:42,898 INFO L273 TraceCheckUtils]: 68: Hoare triple {8239#false} ~cond := #in~cond; {8239#false} is VALID [2018-11-23 11:52:42,899 INFO L273 TraceCheckUtils]: 69: Hoare triple {8239#false} assume 0 == ~cond; {8239#false} is VALID [2018-11-23 11:52:42,899 INFO L273 TraceCheckUtils]: 70: Hoare triple {8239#false} assume !false; {8239#false} is VALID [2018-11-23 11:52:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:42,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:42,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:52:42,921 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-23 11:52:42,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:42,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:52:42,980 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 11:52:42,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:52:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:52:42,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:42,982 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 23 states. [2018-11-23 11:52:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,258 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-11-23 11:52:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:52:43,259 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-11-23 11:52:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2018-11-23 11:52:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2018-11-23 11:52:43,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 80 transitions. [2018-11-23 11:52:43,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:43,377 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:52:43,378 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:52:43,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:52:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-23 11:52:43,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:43,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2018-11-23 11:52:43,407 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2018-11-23 11:52:43,407 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2018-11-23 11:52:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,408 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-23 11:52:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-23 11:52:43,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:43,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:43,408 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2018-11-23 11:52:43,409 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2018-11-23 11:52:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,410 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-23 11:52:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-23 11:52:43,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:43,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:43,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:43,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:52:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-23 11:52:43,412 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2018-11-23 11:52:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-23 11:52:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:52:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 11:52:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:52:43,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:43,414 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:43,414 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:43,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1514191948, now seen corresponding path program 20 times [2018-11-23 11:52:43,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:43,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:43,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:43,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {8908#true} call ULTIMATE.init(); {8908#true} is VALID [2018-11-23 11:52:43,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {8908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8908#true} is VALID [2018-11-23 11:52:43,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {8908#true} assume true; {8908#true} is VALID [2018-11-23 11:52:43,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8908#true} {8908#true} #63#return; {8908#true} is VALID [2018-11-23 11:52:43,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {8908#true} call #t~ret8 := main(); {8908#true} is VALID [2018-11-23 11:52:43,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {8908#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8910#(= main_~a~0 0)} is VALID [2018-11-23 11:52:43,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {8910#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8910#(= main_~a~0 0)} is VALID [2018-11-23 11:52:43,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {8910#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:43,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {8911#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8911#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:43,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {8911#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:43,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {8912#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8912#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:43,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {8912#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:43,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {8913#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8913#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:43,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {8913#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:43,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {8914#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8914#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:43,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {8914#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:43,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {8915#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8915#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:43,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {8915#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8916#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:43,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {8916#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8916#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:43,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {8916#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8917#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:43,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {8917#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8917#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:43,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8918#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:43,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8918#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:43,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {8918#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:43,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {8919#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:43,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {8919#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8920#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:43,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {8920#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8920#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:43,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {8920#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8921#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:43,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {8921#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8921#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:43,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {8921#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8922#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:43,842 INFO L273 TraceCheckUtils]: 30: Hoare triple {8922#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8922#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:43,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {8922#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8923#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:43,843 INFO L273 TraceCheckUtils]: 32: Hoare triple {8923#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8923#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:43,844 INFO L273 TraceCheckUtils]: 33: Hoare triple {8923#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8924#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:43,844 INFO L273 TraceCheckUtils]: 34: Hoare triple {8924#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8924#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:43,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {8924#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8925#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:43,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {8925#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8925#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:43,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {8925#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8926#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:43,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {8926#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8926#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:43,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {8926#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8927#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:43,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8927#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:43,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {8927#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8928#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:43,849 INFO L273 TraceCheckUtils]: 42: Hoare triple {8928#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8928#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:43,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {8928#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8929#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:43,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {8929#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8929#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:43,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {8929#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8930#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:43,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {8930#(<= main_~a~0 20)} assume !(~a~0 < 100000); {8909#false} is VALID [2018-11-23 11:52:43,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#false} havoc ~i~0;~i~0 := 0; {8909#false} is VALID [2018-11-23 11:52:43,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,853 INFO L273 TraceCheckUtils]: 49: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,853 INFO L273 TraceCheckUtils]: 52: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,854 INFO L273 TraceCheckUtils]: 54: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,854 INFO L273 TraceCheckUtils]: 57: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,855 INFO L273 TraceCheckUtils]: 59: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,855 INFO L273 TraceCheckUtils]: 60: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,855 INFO L273 TraceCheckUtils]: 61: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,855 INFO L273 TraceCheckUtils]: 62: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 63: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 64: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 65: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 66: Hoare triple {8909#false} assume !(~i~0 < 100000); {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 67: Hoare triple {8909#false} havoc ~x~0;~x~0 := 0; {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 68: Hoare triple {8909#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L256 TraceCheckUtils]: 69: Hoare triple {8909#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 70: Hoare triple {8909#false} ~cond := #in~cond; {8909#false} is VALID [2018-11-23 11:52:43,856 INFO L273 TraceCheckUtils]: 71: Hoare triple {8909#false} assume 0 == ~cond; {8909#false} is VALID [2018-11-23 11:52:43,857 INFO L273 TraceCheckUtils]: 72: Hoare triple {8909#false} assume !false; {8909#false} is VALID [2018-11-23 11:52:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:43,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:43,860 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 11:52:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:43,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:43,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:43,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:44,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {8908#true} call ULTIMATE.init(); {8908#true} is VALID [2018-11-23 11:52:44,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {8908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8908#true} is VALID [2018-11-23 11:52:44,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {8908#true} assume true; {8908#true} is VALID [2018-11-23 11:52:44,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8908#true} {8908#true} #63#return; {8908#true} is VALID [2018-11-23 11:52:44,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {8908#true} call #t~ret8 := main(); {8908#true} is VALID [2018-11-23 11:52:44,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {8908#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8949#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:44,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {8949#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8949#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:44,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {8949#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:44,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {8911#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8911#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:44,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {8911#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:44,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {8912#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8912#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:44,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {8912#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:44,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {8913#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8913#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:44,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {8913#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:44,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {8914#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8914#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:44,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {8914#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:44,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {8915#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8915#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:44,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {8915#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8916#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:44,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {8916#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8916#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:44,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {8916#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8917#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:44,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {8917#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8917#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:44,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8918#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:44,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8918#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:44,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {8918#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8919#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:44,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {8919#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8919#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:44,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {8919#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8920#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:44,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {8920#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8920#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:44,308 INFO L273 TraceCheckUtils]: 27: Hoare triple {8920#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8921#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:44,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {8921#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8921#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:44,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {8921#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8922#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:44,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {8922#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8922#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:44,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {8922#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8923#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:44,311 INFO L273 TraceCheckUtils]: 32: Hoare triple {8923#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8923#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:44,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {8923#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8924#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:44,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {8924#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8924#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:44,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {8924#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8925#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:44,314 INFO L273 TraceCheckUtils]: 36: Hoare triple {8925#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8925#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:44,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {8925#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8926#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:44,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {8926#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8926#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:44,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {8926#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8927#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:44,317 INFO L273 TraceCheckUtils]: 40: Hoare triple {8927#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8927#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:44,317 INFO L273 TraceCheckUtils]: 41: Hoare triple {8927#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8928#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:44,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {8928#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8928#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:44,319 INFO L273 TraceCheckUtils]: 43: Hoare triple {8928#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8929#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:44,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {8929#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8929#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:44,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {8929#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8930#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:44,321 INFO L273 TraceCheckUtils]: 46: Hoare triple {8930#(<= main_~a~0 20)} assume !(~a~0 < 100000); {8909#false} is VALID [2018-11-23 11:52:44,321 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#false} havoc ~i~0;~i~0 := 0; {8909#false} is VALID [2018-11-23 11:52:44,321 INFO L273 TraceCheckUtils]: 48: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,321 INFO L273 TraceCheckUtils]: 49: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,321 INFO L273 TraceCheckUtils]: 50: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,322 INFO L273 TraceCheckUtils]: 51: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,322 INFO L273 TraceCheckUtils]: 52: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,322 INFO L273 TraceCheckUtils]: 53: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,322 INFO L273 TraceCheckUtils]: 54: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,322 INFO L273 TraceCheckUtils]: 55: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,323 INFO L273 TraceCheckUtils]: 57: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,323 INFO L273 TraceCheckUtils]: 58: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,323 INFO L273 TraceCheckUtils]: 59: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,323 INFO L273 TraceCheckUtils]: 60: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,324 INFO L273 TraceCheckUtils]: 61: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,324 INFO L273 TraceCheckUtils]: 63: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {8909#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8909#false} is VALID [2018-11-23 11:52:44,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {8909#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {8909#false} assume !(~i~0 < 100000); {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L273 TraceCheckUtils]: 67: Hoare triple {8909#false} havoc ~x~0;~x~0 := 0; {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {8909#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L256 TraceCheckUtils]: 69: Hoare triple {8909#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {8909#false} ~cond := #in~cond; {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L273 TraceCheckUtils]: 71: Hoare triple {8909#false} assume 0 == ~cond; {8909#false} is VALID [2018-11-23 11:52:44,325 INFO L273 TraceCheckUtils]: 72: Hoare triple {8909#false} assume !false; {8909#false} is VALID [2018-11-23 11:52:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:44,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:44,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:52:44,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 11:52:44,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:44,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:52:44,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:44,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:52:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:52:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:44,413 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 24 states. [2018-11-23 11:52:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,803 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-11-23 11:52:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:52:44,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 11:52:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 82 transitions. [2018-11-23 11:52:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 82 transitions. [2018-11-23 11:52:44,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 82 transitions. [2018-11-23 11:52:44,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:44,923 INFO L225 Difference]: With dead ends: 112 [2018-11-23 11:52:44,923 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:52:44,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:52:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 11:52:44,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:44,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-23 11:52:44,952 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-23 11:52:44,952 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-23 11:52:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,955 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 11:52:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 11:52:44,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:44,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:44,955 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-23 11:52:44,956 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-23 11:52:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:44,957 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 11:52:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 11:52:44,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:44,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:44,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:44,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:52:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-23 11:52:44,960 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 73 [2018-11-23 11:52:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:44,960 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-23 11:52:44,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:52:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-23 11:52:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:52:44,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:44,961 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:44,961 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:44,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1231470358, now seen corresponding path program 21 times [2018-11-23 11:52:44,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:44,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:44,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:44,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:44,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {9595#true} call ULTIMATE.init(); {9595#true} is VALID [2018-11-23 11:52:45,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {9595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9595#true} is VALID [2018-11-23 11:52:45,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {9595#true} assume true; {9595#true} is VALID [2018-11-23 11:52:45,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9595#true} {9595#true} #63#return; {9595#true} is VALID [2018-11-23 11:52:45,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {9595#true} call #t~ret8 := main(); {9595#true} is VALID [2018-11-23 11:52:45,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {9595#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9597#(= main_~a~0 0)} is VALID [2018-11-23 11:52:45,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {9597#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9597#(= main_~a~0 0)} is VALID [2018-11-23 11:52:45,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {9597#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9598#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:45,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {9598#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9598#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:45,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {9598#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9599#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:45,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {9599#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9599#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:45,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {9599#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9600#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:45,454 INFO L273 TraceCheckUtils]: 12: Hoare triple {9600#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9600#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:45,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {9600#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9601#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:45,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {9601#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9601#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:45,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {9601#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9602#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:45,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {9602#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9602#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:45,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {9602#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9603#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:45,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {9603#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9603#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:45,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {9603#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9604#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:45,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {9604#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9604#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:45,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {9604#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9605#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:45,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {9605#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9605#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:45,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {9605#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9606#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:45,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {9606#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9606#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:45,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {9606#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9607#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:45,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {9607#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9607#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:45,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {9607#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9608#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:45,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {9608#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9608#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:45,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {9608#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9609#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:45,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {9609#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9609#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:45,467 INFO L273 TraceCheckUtils]: 31: Hoare triple {9609#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9610#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:45,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {9610#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9610#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:45,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {9610#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9611#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:45,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {9611#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9611#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:45,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {9611#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9612#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:45,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {9612#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9612#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:45,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {9612#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9613#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:45,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {9613#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9613#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:45,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {9613#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9614#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:45,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {9614#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9614#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:45,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {9614#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9615#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:45,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {9615#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9615#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:45,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {9615#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9616#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:45,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {9616#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9616#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:45,476 INFO L273 TraceCheckUtils]: 45: Hoare triple {9616#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9617#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:45,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {9617#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9617#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:45,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {9617#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9618#(<= main_~a~0 21)} is VALID [2018-11-23 11:52:45,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {9618#(<= main_~a~0 21)} assume !(~a~0 < 100000); {9596#false} is VALID [2018-11-23 11:52:45,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {9596#false} havoc ~i~0;~i~0 := 0; {9596#false} is VALID [2018-11-23 11:52:45,478 INFO L273 TraceCheckUtils]: 50: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,480 INFO L273 TraceCheckUtils]: 56: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,481 INFO L273 TraceCheckUtils]: 61: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,481 INFO L273 TraceCheckUtils]: 62: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,481 INFO L273 TraceCheckUtils]: 63: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,481 INFO L273 TraceCheckUtils]: 64: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,482 INFO L273 TraceCheckUtils]: 66: Hoare triple {9596#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9596#false} is VALID [2018-11-23 11:52:45,482 INFO L273 TraceCheckUtils]: 67: Hoare triple {9596#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9596#false} is VALID [2018-11-23 11:52:45,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {9596#false} assume !(~i~0 < 100000); {9596#false} is VALID [2018-11-23 11:52:45,482 INFO L273 TraceCheckUtils]: 69: Hoare triple {9596#false} havoc ~x~0;~x~0 := 0; {9596#false} is VALID [2018-11-23 11:52:45,482 INFO L273 TraceCheckUtils]: 70: Hoare triple {9596#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9596#false} is VALID [2018-11-23 11:52:45,483 INFO L256 TraceCheckUtils]: 71: Hoare triple {9596#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9596#false} is VALID [2018-11-23 11:52:45,483 INFO L273 TraceCheckUtils]: 72: Hoare triple {9596#false} ~cond := #in~cond; {9596#false} is VALID [2018-11-23 11:52:45,483 INFO L273 TraceCheckUtils]: 73: Hoare triple {9596#false} assume 0 == ~cond; {9596#false} is VALID [2018-11-23 11:52:45,483 INFO L273 TraceCheckUtils]: 74: Hoare triple {9596#false} assume !false; {9596#false} is VALID [2018-11-23 11:52:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:52:45,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:45,487 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 11:52:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:46,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 11:52:46,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:46,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:46,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {9595#true} call ULTIMATE.init(); {9595#true} is VALID [2018-11-23 11:52:46,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {9595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9595#true} is VALID [2018-11-23 11:52:46,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {9595#true} assume true; {9595#true} is VALID [2018-11-23 11:52:46,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9595#true} {9595#true} #63#return; {9595#true} is VALID [2018-11-23 11:52:46,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {9595#true} call #t~ret8 := main(); {9595#true} is VALID [2018-11-23 11:52:46,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {9595#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9595#true} is VALID [2018-11-23 11:52:46,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,420 INFO L273 TraceCheckUtils]: 35: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 39: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 42: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 43: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,421 INFO L273 TraceCheckUtils]: 44: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,422 INFO L273 TraceCheckUtils]: 45: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,422 INFO L273 TraceCheckUtils]: 46: Hoare triple {9595#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9595#true} is VALID [2018-11-23 11:52:46,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {9595#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9595#true} is VALID [2018-11-23 11:52:46,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {9595#true} assume !(~a~0 < 100000); {9595#true} is VALID [2018-11-23 11:52:46,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {9595#true} havoc ~i~0;~i~0 := 0; {9769#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:46,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {9769#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9769#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:46,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {9769#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9776#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:46,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {9776#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9776#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:46,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {9776#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9783#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:46,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {9783#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9783#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:46,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {9783#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9790#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:46,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {9790#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9790#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:46,426 INFO L273 TraceCheckUtils]: 57: Hoare triple {9790#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9797#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:46,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {9797#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9797#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:46,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {9797#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9804#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:46,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {9804#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9804#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:46,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {9804#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9811#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:46,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {9811#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9811#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:46,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {9811#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9818#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:46,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {9818#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9818#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:46,431 INFO L273 TraceCheckUtils]: 65: Hoare triple {9818#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9825#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:46,431 INFO L273 TraceCheckUtils]: 66: Hoare triple {9825#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9825#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:46,432 INFO L273 TraceCheckUtils]: 67: Hoare triple {9825#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9832#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:46,433 INFO L273 TraceCheckUtils]: 68: Hoare triple {9832#(<= main_~i~0 9)} assume !(~i~0 < 100000); {9596#false} is VALID [2018-11-23 11:52:46,433 INFO L273 TraceCheckUtils]: 69: Hoare triple {9596#false} havoc ~x~0;~x~0 := 0; {9596#false} is VALID [2018-11-23 11:52:46,433 INFO L273 TraceCheckUtils]: 70: Hoare triple {9596#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {9596#false} is VALID [2018-11-23 11:52:46,433 INFO L256 TraceCheckUtils]: 71: Hoare triple {9596#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {9596#false} is VALID [2018-11-23 11:52:46,433 INFO L273 TraceCheckUtils]: 72: Hoare triple {9596#false} ~cond := #in~cond; {9596#false} is VALID [2018-11-23 11:52:46,434 INFO L273 TraceCheckUtils]: 73: Hoare triple {9596#false} assume 0 == ~cond; {9596#false} is VALID [2018-11-23 11:52:46,434 INFO L273 TraceCheckUtils]: 74: Hoare triple {9596#false} assume !false; {9596#false} is VALID [2018-11-23 11:52:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-23 11:52:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:46,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12] total 34 [2018-11-23 11:52:46,457 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-11-23 11:52:46,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:46,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:52:46,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:46,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:52:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:52:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=781, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:46,547 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 34 states. [2018-11-23 11:52:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,195 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-11-23 11:52:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:52:47,195 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-11-23 11:52:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 105 transitions. [2018-11-23 11:52:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 105 transitions. [2018-11-23 11:52:47,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 105 transitions. [2018-11-23 11:52:47,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:47,301 INFO L225 Difference]: With dead ends: 117 [2018-11-23 11:52:47,301 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 11:52:47,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=781, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 11:52:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-23 11:52:47,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:47,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 84 states. [2018-11-23 11:52:47,334 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 84 states. [2018-11-23 11:52:47,334 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 84 states. [2018-11-23 11:52:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,335 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 11:52:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 11:52:47,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:47,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:47,336 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 86 states. [2018-11-23 11:52:47,336 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 86 states. [2018-11-23 11:52:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:47,337 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 11:52:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 11:52:47,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:47,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:47,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:47,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:52:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-11-23 11:52:47,339 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 75 [2018-11-23 11:52:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:47,339 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-11-23 11:52:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:52:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-23 11:52:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:47,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:47,340 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:47,340 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:47,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash 876526438, now seen corresponding path program 22 times [2018-11-23 11:52:47,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:47,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:47,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {10321#true} call ULTIMATE.init(); {10321#true} is VALID [2018-11-23 11:52:48,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {10321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10321#true} is VALID [2018-11-23 11:52:48,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {10321#true} assume true; {10321#true} is VALID [2018-11-23 11:52:48,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10321#true} {10321#true} #63#return; {10321#true} is VALID [2018-11-23 11:52:48,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {10321#true} call #t~ret8 := main(); {10321#true} is VALID [2018-11-23 11:52:48,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {10321#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10323#(= main_~a~0 0)} is VALID [2018-11-23 11:52:48,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {10323#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10323#(= main_~a~0 0)} is VALID [2018-11-23 11:52:48,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {10323#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10324#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {10324#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10324#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:48,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {10324#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10325#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {10325#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10325#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:48,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {10325#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10326#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {10326#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10326#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:48,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {10326#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10327#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {10327#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10327#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:48,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {10327#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10328#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {10328#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10328#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:48,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {10328#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10329#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {10329#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10329#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:48,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {10329#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10330#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {10330#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10330#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:48,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {10330#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10331#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,011 INFO L273 TraceCheckUtils]: 22: Hoare triple {10331#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10331#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:48,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {10331#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10332#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:48,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {10332#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10332#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:48,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {10332#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10333#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:48,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {10333#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10333#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:48,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {10333#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10334#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:48,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {10334#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10334#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:48,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {10334#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10335#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:48,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {10335#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10335#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:48,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {10335#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10336#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:48,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {10336#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10336#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:48,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {10336#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10337#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:48,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10337#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:48,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {10337#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10338#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:48,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {10338#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10338#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:48,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {10338#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10339#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:48,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {10339#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10339#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:48,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {10339#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10340#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:48,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {10340#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10340#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:48,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {10340#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10341#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:48,023 INFO L273 TraceCheckUtils]: 42: Hoare triple {10341#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10341#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:48,024 INFO L273 TraceCheckUtils]: 43: Hoare triple {10341#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10342#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:48,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {10342#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10342#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:48,025 INFO L273 TraceCheckUtils]: 45: Hoare triple {10342#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10343#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:48,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {10343#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10343#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:48,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {10343#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10344#(<= main_~a~0 21)} is VALID [2018-11-23 11:52:48,027 INFO L273 TraceCheckUtils]: 48: Hoare triple {10344#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10344#(<= main_~a~0 21)} is VALID [2018-11-23 11:52:48,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {10344#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10345#(<= main_~a~0 22)} is VALID [2018-11-23 11:52:48,028 INFO L273 TraceCheckUtils]: 50: Hoare triple {10345#(<= main_~a~0 22)} assume !(~a~0 < 100000); {10322#false} is VALID [2018-11-23 11:52:48,028 INFO L273 TraceCheckUtils]: 51: Hoare triple {10322#false} havoc ~i~0;~i~0 := 0; {10322#false} is VALID [2018-11-23 11:52:48,029 INFO L273 TraceCheckUtils]: 52: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,029 INFO L273 TraceCheckUtils]: 53: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,029 INFO L273 TraceCheckUtils]: 54: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,029 INFO L273 TraceCheckUtils]: 55: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,029 INFO L273 TraceCheckUtils]: 56: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,030 INFO L273 TraceCheckUtils]: 57: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,030 INFO L273 TraceCheckUtils]: 58: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,030 INFO L273 TraceCheckUtils]: 59: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,030 INFO L273 TraceCheckUtils]: 60: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,030 INFO L273 TraceCheckUtils]: 61: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,031 INFO L273 TraceCheckUtils]: 62: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,031 INFO L273 TraceCheckUtils]: 63: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,031 INFO L273 TraceCheckUtils]: 64: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,031 INFO L273 TraceCheckUtils]: 65: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,031 INFO L273 TraceCheckUtils]: 66: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,031 INFO L273 TraceCheckUtils]: 67: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,032 INFO L273 TraceCheckUtils]: 68: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,032 INFO L273 TraceCheckUtils]: 69: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,032 INFO L273 TraceCheckUtils]: 70: Hoare triple {10322#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10322#false} is VALID [2018-11-23 11:52:48,032 INFO L273 TraceCheckUtils]: 71: Hoare triple {10322#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10322#false} is VALID [2018-11-23 11:52:48,032 INFO L273 TraceCheckUtils]: 72: Hoare triple {10322#false} assume !(~i~0 < 100000); {10322#false} is VALID [2018-11-23 11:52:48,033 INFO L273 TraceCheckUtils]: 73: Hoare triple {10322#false} havoc ~x~0;~x~0 := 0; {10322#false} is VALID [2018-11-23 11:52:48,033 INFO L273 TraceCheckUtils]: 74: Hoare triple {10322#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {10322#false} is VALID [2018-11-23 11:52:48,033 INFO L256 TraceCheckUtils]: 75: Hoare triple {10322#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10322#false} is VALID [2018-11-23 11:52:48,033 INFO L273 TraceCheckUtils]: 76: Hoare triple {10322#false} ~cond := #in~cond; {10322#false} is VALID [2018-11-23 11:52:48,033 INFO L273 TraceCheckUtils]: 77: Hoare triple {10322#false} assume 0 == ~cond; {10322#false} is VALID [2018-11-23 11:52:48,033 INFO L273 TraceCheckUtils]: 78: Hoare triple {10322#false} assume !false; {10322#false} is VALID [2018-11-23 11:52:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:52:48,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:48,037 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 11:52:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:48,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:48,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:48,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:48,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {10321#true} call ULTIMATE.init(); {10321#true} is VALID [2018-11-23 11:52:48,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {10321#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10321#true} is VALID [2018-11-23 11:52:48,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {10321#true} assume true; {10321#true} is VALID [2018-11-23 11:52:48,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10321#true} {10321#true} #63#return; {10321#true} is VALID [2018-11-23 11:52:48,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {10321#true} call #t~ret8 := main(); {10321#true} is VALID [2018-11-23 11:52:48,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {10321#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10321#true} is VALID [2018-11-23 11:52:48,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 16: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 17: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 27: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 38: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 43: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 44: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 45: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 46: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 47: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 48: Hoare triple {10321#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10321#true} is VALID [2018-11-23 11:52:48,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {10321#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10321#true} is VALID [2018-11-23 11:52:48,433 INFO L273 TraceCheckUtils]: 50: Hoare triple {10321#true} assume !(~a~0 < 100000); {10321#true} is VALID [2018-11-23 11:52:48,433 INFO L273 TraceCheckUtils]: 51: Hoare triple {10321#true} havoc ~i~0;~i~0 := 0; {10502#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:48,433 INFO L273 TraceCheckUtils]: 52: Hoare triple {10502#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10502#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:48,434 INFO L273 TraceCheckUtils]: 53: Hoare triple {10502#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10509#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:48,434 INFO L273 TraceCheckUtils]: 54: Hoare triple {10509#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10509#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:48,435 INFO L273 TraceCheckUtils]: 55: Hoare triple {10509#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10516#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:48,435 INFO L273 TraceCheckUtils]: 56: Hoare triple {10516#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10516#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:48,435 INFO L273 TraceCheckUtils]: 57: Hoare triple {10516#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10523#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:48,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {10523#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10523#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:48,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {10523#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10530#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:48,437 INFO L273 TraceCheckUtils]: 60: Hoare triple {10530#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10530#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:48,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {10530#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10537#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:48,438 INFO L273 TraceCheckUtils]: 62: Hoare triple {10537#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10537#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:48,439 INFO L273 TraceCheckUtils]: 63: Hoare triple {10537#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10544#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:48,439 INFO L273 TraceCheckUtils]: 64: Hoare triple {10544#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10544#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:48,440 INFO L273 TraceCheckUtils]: 65: Hoare triple {10544#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10551#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:48,440 INFO L273 TraceCheckUtils]: 66: Hoare triple {10551#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10551#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:48,441 INFO L273 TraceCheckUtils]: 67: Hoare triple {10551#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:48,442 INFO L273 TraceCheckUtils]: 68: Hoare triple {10558#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:48,442 INFO L273 TraceCheckUtils]: 69: Hoare triple {10558#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10565#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:48,443 INFO L273 TraceCheckUtils]: 70: Hoare triple {10565#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {10565#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:48,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {10565#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10572#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:48,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {10572#(<= main_~i~0 10)} assume !(~i~0 < 100000); {10322#false} is VALID [2018-11-23 11:52:48,445 INFO L273 TraceCheckUtils]: 73: Hoare triple {10322#false} havoc ~x~0;~x~0 := 0; {10322#false} is VALID [2018-11-23 11:52:48,445 INFO L273 TraceCheckUtils]: 74: Hoare triple {10322#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {10322#false} is VALID [2018-11-23 11:52:48,445 INFO L256 TraceCheckUtils]: 75: Hoare triple {10322#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {10322#false} is VALID [2018-11-23 11:52:48,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {10322#false} ~cond := #in~cond; {10322#false} is VALID [2018-11-23 11:52:48,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {10322#false} assume 0 == ~cond; {10322#false} is VALID [2018-11-23 11:52:48,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {10322#false} assume !false; {10322#false} is VALID [2018-11-23 11:52:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 11:52:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13] total 36 [2018-11-23 11:52:48,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-23 11:52:48,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:48,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:52:48,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:52:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:52:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:48,566 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 36 states. [2018-11-23 11:52:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,375 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-11-23 11:52:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:52:49,375 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-23 11:52:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 109 transitions. [2018-11-23 11:52:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 109 transitions. [2018-11-23 11:52:49,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 109 transitions. [2018-11-23 11:52:49,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:49,597 INFO L225 Difference]: With dead ends: 123 [2018-11-23 11:52:49,597 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:52:49,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=883, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:52:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 11:52:49,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:49,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 11:52:49,676 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 11:52:49,676 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 11:52:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,678 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 11:52:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:52:49,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:49,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:49,679 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 11:52:49,679 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 11:52:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,681 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 11:52:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:52:49,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:49,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:49,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:49,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:52:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-11-23 11:52:49,683 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 79 [2018-11-23 11:52:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:49,683 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-23 11:52:49,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:52:49,684 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-11-23 11:52:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:52:49,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:49,684 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:49,685 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:49,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1897367522, now seen corresponding path program 23 times [2018-11-23 11:52:49,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:49,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:51,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-23 11:52:51,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-23 11:52:51,376 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-23 11:52:51,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #63#return; {11084#true} is VALID [2018-11-23 11:52:51,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret8 := main(); {11084#true} is VALID [2018-11-23 11:52:51,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {11084#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11086#(= main_~a~0 0)} is VALID [2018-11-23 11:52:51,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {11086#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11086#(= main_~a~0 0)} is VALID [2018-11-23 11:52:51,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {11086#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11087#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:51,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11087#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:51,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {11087#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11088#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:51,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11088#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:51,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {11088#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11089#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:51,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11089#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:51,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {11089#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11090#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:51,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11090#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:51,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {11090#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11091#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:51,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11091#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:51,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {11091#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11092#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:51,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11092#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:51,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {11092#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11093#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:51,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11093#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:51,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {11093#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11094#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:51,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11094#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:51,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {11094#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11095#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:51,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11095#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:51,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {11095#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11096#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:51,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11096#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:51,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {11096#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11097#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:51,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11097#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:51,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {11097#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11098#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:51,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11098#(<= main_~a~0 12)} is VALID [2018-11-23 11:52:51,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {11098#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11099#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:51,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11099#(<= main_~a~0 13)} is VALID [2018-11-23 11:52:51,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {11099#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11100#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:51,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11100#(<= main_~a~0 14)} is VALID [2018-11-23 11:52:51,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {11100#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11101#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:51,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11101#(<= main_~a~0 15)} is VALID [2018-11-23 11:52:51,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11102#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:51,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11102#(<= main_~a~0 16)} is VALID [2018-11-23 11:52:51,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11103#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:51,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11103#(<= main_~a~0 17)} is VALID [2018-11-23 11:52:51,400 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11104#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:51,401 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11104#(<= main_~a~0 18)} is VALID [2018-11-23 11:52:51,402 INFO L273 TraceCheckUtils]: 43: Hoare triple {11104#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11105#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:51,402 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11105#(<= main_~a~0 19)} is VALID [2018-11-23 11:52:51,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {11105#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11106#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:51,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11106#(<= main_~a~0 20)} is VALID [2018-11-23 11:52:51,405 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11107#(<= main_~a~0 21)} is VALID [2018-11-23 11:52:51,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {11107#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11107#(<= main_~a~0 21)} is VALID [2018-11-23 11:52:51,406 INFO L273 TraceCheckUtils]: 49: Hoare triple {11107#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11108#(<= main_~a~0 22)} is VALID [2018-11-23 11:52:51,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {11108#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11108#(<= main_~a~0 22)} is VALID [2018-11-23 11:52:51,407 INFO L273 TraceCheckUtils]: 51: Hoare triple {11108#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11109#(<= main_~a~0 23)} is VALID [2018-11-23 11:52:51,408 INFO L273 TraceCheckUtils]: 52: Hoare triple {11109#(<= main_~a~0 23)} assume !(~a~0 < 100000); {11085#false} is VALID [2018-11-23 11:52:51,408 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} havoc ~i~0;~i~0 := 0; {11085#false} is VALID [2018-11-23 11:52:51,409 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,409 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,409 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,410 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,410 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,410 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,410 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,411 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,411 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,411 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,411 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,411 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,411 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:52:51,412 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:52:51,413 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-23 11:52:51,413 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-23 11:52:51,413 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11085#false} is VALID [2018-11-23 11:52:51,413 INFO L256 TraceCheckUtils]: 79: Hoare triple {11085#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11085#false} is VALID [2018-11-23 11:52:51,413 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-23 11:52:51,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume 0 == ~cond; {11085#false} is VALID [2018-11-23 11:52:51,414 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-23 11:52:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:52:51,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:51,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 11:52:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:57,176 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:53:57,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:57,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:57,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {11084#true} call ULTIMATE.init(); {11084#true} is VALID [2018-11-23 11:53:57,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {11084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11084#true} is VALID [2018-11-23 11:53:57,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {11084#true} assume true; {11084#true} is VALID [2018-11-23 11:53:57,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11084#true} {11084#true} #63#return; {11084#true} is VALID [2018-11-23 11:53:57,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {11084#true} call #t~ret8 := main(); {11084#true} is VALID [2018-11-23 11:53:57,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {11084#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11128#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:57,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {11128#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11128#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:57,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {11128#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11087#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:57,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {11087#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11087#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:57,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {11087#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11088#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:57,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {11088#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11088#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:57,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {11088#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11089#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:57,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {11089#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11089#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:57,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {11089#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11090#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:57,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {11090#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11090#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:57,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {11090#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11091#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:57,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {11091#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11091#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:57,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {11091#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11092#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:57,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {11092#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11092#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:57,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {11092#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11093#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:57,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {11093#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11093#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:57,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {11093#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11094#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:57,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {11094#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11094#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:57,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {11094#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11095#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:57,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {11095#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11095#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:57,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {11095#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11096#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:57,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {11096#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11096#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:57,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {11096#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11097#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:57,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {11097#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11097#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:57,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {11097#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11098#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:57,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {11098#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11098#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:57,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {11098#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11099#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:57,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {11099#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11099#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:57,410 INFO L273 TraceCheckUtils]: 33: Hoare triple {11099#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11100#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:57,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11100#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:57,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {11100#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11101#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:57,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {11101#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11101#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:57,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {11101#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11102#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:57,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {11102#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11102#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:57,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {11102#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11103#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:57,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {11103#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11103#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:57,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {11103#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11104#(<= main_~a~0 18)} is VALID [2018-11-23 11:53:57,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {11104#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11104#(<= main_~a~0 18)} is VALID [2018-11-23 11:53:57,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {11104#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11105#(<= main_~a~0 19)} is VALID [2018-11-23 11:53:57,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {11105#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11105#(<= main_~a~0 19)} is VALID [2018-11-23 11:53:57,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {11105#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11106#(<= main_~a~0 20)} is VALID [2018-11-23 11:53:57,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {11106#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11106#(<= main_~a~0 20)} is VALID [2018-11-23 11:53:57,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {11106#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11107#(<= main_~a~0 21)} is VALID [2018-11-23 11:53:57,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {11107#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11107#(<= main_~a~0 21)} is VALID [2018-11-23 11:53:57,420 INFO L273 TraceCheckUtils]: 49: Hoare triple {11107#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11108#(<= main_~a~0 22)} is VALID [2018-11-23 11:53:57,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {11108#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11108#(<= main_~a~0 22)} is VALID [2018-11-23 11:53:57,421 INFO L273 TraceCheckUtils]: 51: Hoare triple {11108#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11109#(<= main_~a~0 23)} is VALID [2018-11-23 11:53:57,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {11109#(<= main_~a~0 23)} assume !(~a~0 < 100000); {11085#false} is VALID [2018-11-23 11:53:57,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {11085#false} havoc ~i~0;~i~0 := 0; {11085#false} is VALID [2018-11-23 11:53:57,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,423 INFO L273 TraceCheckUtils]: 55: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,423 INFO L273 TraceCheckUtils]: 58: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,423 INFO L273 TraceCheckUtils]: 59: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,424 INFO L273 TraceCheckUtils]: 60: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 68: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,425 INFO L273 TraceCheckUtils]: 72: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 73: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 74: Hoare triple {11085#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 75: Hoare triple {11085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 76: Hoare triple {11085#false} assume !(~i~0 < 100000); {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 77: Hoare triple {11085#false} havoc ~x~0;~x~0 := 0; {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 78: Hoare triple {11085#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L256 TraceCheckUtils]: 79: Hoare triple {11085#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 80: Hoare triple {11085#false} ~cond := #in~cond; {11085#false} is VALID [2018-11-23 11:53:57,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {11085#false} assume 0 == ~cond; {11085#false} is VALID [2018-11-23 11:53:57,427 INFO L273 TraceCheckUtils]: 82: Hoare triple {11085#false} assume !false; {11085#false} is VALID [2018-11-23 11:53:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:53:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:53:57,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-23 11:53:57,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:57,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:53:57,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:57,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:53:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:53:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:53:57,538 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 27 states. [2018-11-23 11:53:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:58,076 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 11:53:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:53:58,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2018-11-23 11:53:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:53:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 88 transitions. [2018-11-23 11:53:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:53:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 88 transitions. [2018-11-23 11:53:58,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 88 transitions. [2018-11-23 11:53:58,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:58,170 INFO L225 Difference]: With dead ends: 126 [2018-11-23 11:53:58,170 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:53:58,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:53:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:53:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-23 11:53:58,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:58,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 90 states. [2018-11-23 11:53:58,206 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 90 states. [2018-11-23 11:53:58,206 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 90 states. [2018-11-23 11:53:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:58,208 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-23 11:53:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-23 11:53:58,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:58,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:58,209 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 91 states. [2018-11-23 11:53:58,209 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 91 states. [2018-11-23 11:53:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:58,211 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-23 11:53:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-23 11:53:58,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:58,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:58,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:58,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:53:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-11-23 11:53:58,213 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2018-11-23 11:53:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:58,214 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-11-23 11:53:58,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:53:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 11:53:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:53:58,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:58,214 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:58,215 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:58,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 281108224, now seen corresponding path program 24 times [2018-11-23 11:53:58,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:58,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:58,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:58,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:58,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:59,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {11860#true} call ULTIMATE.init(); {11860#true} is VALID [2018-11-23 11:53:59,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {11860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11860#true} is VALID [2018-11-23 11:53:59,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-23 11:53:59,215 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11860#true} {11860#true} #63#return; {11860#true} is VALID [2018-11-23 11:53:59,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {11860#true} call #t~ret8 := main(); {11860#true} is VALID [2018-11-23 11:53:59,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {11860#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11862#(= main_~a~0 0)} is VALID [2018-11-23 11:53:59,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {11862#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11862#(= main_~a~0 0)} is VALID [2018-11-23 11:53:59,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {11862#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11863#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:59,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {11863#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11863#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:59,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {11863#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11864#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:59,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {11864#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11864#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:59,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {11864#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11865#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:59,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {11865#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11865#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:59,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {11865#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11866#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:59,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {11866#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11866#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:59,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {11866#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11867#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:59,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {11867#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11867#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:59,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {11867#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11868#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:59,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {11868#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11868#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:59,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {11868#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11869#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:59,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {11869#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11869#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:59,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {11869#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11870#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:59,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {11870#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11870#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:59,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {11870#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11871#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:59,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {11871#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11871#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:59,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {11871#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11872#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:59,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {11872#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11872#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:59,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {11872#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11873#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:59,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {11873#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11873#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:59,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {11873#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11874#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:59,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {11874#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11874#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:59,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {11874#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11875#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:59,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {11875#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11875#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:59,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {11875#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11876#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:59,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {11876#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11876#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:59,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {11876#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11877#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:59,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {11877#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11877#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:59,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {11877#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11878#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:59,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {11878#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11878#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:59,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {11878#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11879#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:59,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {11879#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11879#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:59,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {11879#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11880#(<= main_~a~0 18)} is VALID [2018-11-23 11:53:59,238 INFO L273 TraceCheckUtils]: 42: Hoare triple {11880#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11880#(<= main_~a~0 18)} is VALID [2018-11-23 11:53:59,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {11880#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11881#(<= main_~a~0 19)} is VALID [2018-11-23 11:53:59,239 INFO L273 TraceCheckUtils]: 44: Hoare triple {11881#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11881#(<= main_~a~0 19)} is VALID [2018-11-23 11:53:59,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {11881#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11882#(<= main_~a~0 20)} is VALID [2018-11-23 11:53:59,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {11882#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11882#(<= main_~a~0 20)} is VALID [2018-11-23 11:53:59,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {11882#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11883#(<= main_~a~0 21)} is VALID [2018-11-23 11:53:59,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {11883#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11883#(<= main_~a~0 21)} is VALID [2018-11-23 11:53:59,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {11883#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11884#(<= main_~a~0 22)} is VALID [2018-11-23 11:53:59,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {11884#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11884#(<= main_~a~0 22)} is VALID [2018-11-23 11:53:59,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {11884#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11885#(<= main_~a~0 23)} is VALID [2018-11-23 11:53:59,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {11885#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11885#(<= main_~a~0 23)} is VALID [2018-11-23 11:53:59,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {11885#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11886#(<= main_~a~0 24)} is VALID [2018-11-23 11:53:59,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {11886#(<= main_~a~0 24)} assume !(~a~0 < 100000); {11861#false} is VALID [2018-11-23 11:53:59,246 INFO L273 TraceCheckUtils]: 55: Hoare triple {11861#false} havoc ~i~0;~i~0 := 0; {11861#false} is VALID [2018-11-23 11:53:59,246 INFO L273 TraceCheckUtils]: 56: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,246 INFO L273 TraceCheckUtils]: 57: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,246 INFO L273 TraceCheckUtils]: 58: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,246 INFO L273 TraceCheckUtils]: 59: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,247 INFO L273 TraceCheckUtils]: 60: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,247 INFO L273 TraceCheckUtils]: 63: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,248 INFO L273 TraceCheckUtils]: 65: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,249 INFO L273 TraceCheckUtils]: 70: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,249 INFO L273 TraceCheckUtils]: 71: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L273 TraceCheckUtils]: 75: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L273 TraceCheckUtils]: 78: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L273 TraceCheckUtils]: 79: Hoare triple {11861#false} havoc ~x~0;~x~0 := 0; {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L273 TraceCheckUtils]: 80: Hoare triple {11861#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11861#false} is VALID [2018-11-23 11:53:59,250 INFO L256 TraceCheckUtils]: 81: Hoare triple {11861#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11861#false} is VALID [2018-11-23 11:53:59,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {11861#false} ~cond := #in~cond; {11861#false} is VALID [2018-11-23 11:53:59,251 INFO L273 TraceCheckUtils]: 83: Hoare triple {11861#false} assume 0 == ~cond; {11861#false} is VALID [2018-11-23 11:53:59,251 INFO L273 TraceCheckUtils]: 84: Hoare triple {11861#false} assume !false; {11861#false} is VALID [2018-11-23 11:53:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-23 11:53:59,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:59,255 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 11:53:59,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:20,196 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 11:54:20,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:20,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:20,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {11860#true} call ULTIMATE.init(); {11860#true} is VALID [2018-11-23 11:54:20,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {11860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11860#true} is VALID [2018-11-23 11:54:20,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-23 11:54:20,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11860#true} {11860#true} #63#return; {11860#true} is VALID [2018-11-23 11:54:20,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {11860#true} call #t~ret8 := main(); {11860#true} is VALID [2018-11-23 11:54:20,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {11860#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11860#true} is VALID [2018-11-23 11:54:20,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 27: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 33: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 36: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 37: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 38: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 42: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 43: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 45: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 46: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 47: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 48: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,540 INFO L273 TraceCheckUtils]: 49: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,541 INFO L273 TraceCheckUtils]: 50: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,541 INFO L273 TraceCheckUtils]: 52: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-23 11:54:20,541 INFO L273 TraceCheckUtils]: 53: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11860#true} is VALID [2018-11-23 11:54:20,541 INFO L273 TraceCheckUtils]: 54: Hoare triple {11860#true} assume !(~a~0 < 100000); {11860#true} is VALID [2018-11-23 11:54:20,542 INFO L273 TraceCheckUtils]: 55: Hoare triple {11860#true} havoc ~i~0;~i~0 := 0; {12055#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:20,542 INFO L273 TraceCheckUtils]: 56: Hoare triple {12055#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12055#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:20,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {12055#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12062#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:20,543 INFO L273 TraceCheckUtils]: 58: Hoare triple {12062#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12062#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:20,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {12062#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12069#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:20,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {12069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12069#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:20,544 INFO L273 TraceCheckUtils]: 61: Hoare triple {12069#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12076#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:20,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {12076#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12076#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:20,545 INFO L273 TraceCheckUtils]: 63: Hoare triple {12076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12083#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:20,546 INFO L273 TraceCheckUtils]: 64: Hoare triple {12083#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12083#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:20,546 INFO L273 TraceCheckUtils]: 65: Hoare triple {12083#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:20,547 INFO L273 TraceCheckUtils]: 66: Hoare triple {12090#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12090#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:20,548 INFO L273 TraceCheckUtils]: 67: Hoare triple {12090#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12097#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:20,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {12097#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12097#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:20,549 INFO L273 TraceCheckUtils]: 69: Hoare triple {12097#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12104#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:20,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {12104#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12104#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:20,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {12104#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12111#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:20,551 INFO L273 TraceCheckUtils]: 72: Hoare triple {12111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12111#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:20,551 INFO L273 TraceCheckUtils]: 73: Hoare triple {12111#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12118#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:20,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {12118#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12118#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:20,553 INFO L273 TraceCheckUtils]: 75: Hoare triple {12118#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12125#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:20,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {12125#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12125#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:20,554 INFO L273 TraceCheckUtils]: 77: Hoare triple {12125#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12132#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:20,555 INFO L273 TraceCheckUtils]: 78: Hoare triple {12132#(<= main_~i~0 11)} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-23 11:54:20,555 INFO L273 TraceCheckUtils]: 79: Hoare triple {11861#false} havoc ~x~0;~x~0 := 0; {11861#false} is VALID [2018-11-23 11:54:20,555 INFO L273 TraceCheckUtils]: 80: Hoare triple {11861#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {11861#false} is VALID [2018-11-23 11:54:20,555 INFO L256 TraceCheckUtils]: 81: Hoare triple {11861#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {11861#false} is VALID [2018-11-23 11:54:20,555 INFO L273 TraceCheckUtils]: 82: Hoare triple {11861#false} ~cond := #in~cond; {11861#false} is VALID [2018-11-23 11:54:20,556 INFO L273 TraceCheckUtils]: 83: Hoare triple {11861#false} assume 0 == ~cond; {11861#false} is VALID [2018-11-23 11:54:20,556 INFO L273 TraceCheckUtils]: 84: Hoare triple {11861#false} assume !false; {11861#false} is VALID [2018-11-23 11:54:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-23 11:54:20,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:20,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14] total 39 [2018-11-23 11:54:20,584 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2018-11-23 11:54:20,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:20,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:54:20,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:54:20,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:54:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:54:20,723 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 39 states. [2018-11-23 11:54:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:21,658 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-11-23 11:54:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:54:21,658 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2018-11-23 11:54:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:54:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 115 transitions. [2018-11-23 11:54:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:54:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 115 transitions. [2018-11-23 11:54:21,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 115 transitions. [2018-11-23 11:54:21,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:21,780 INFO L225 Difference]: With dead ends: 131 [2018-11-23 11:54:21,780 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 11:54:21,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:54:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 11:54:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-23 11:54:21,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:21,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-23 11:54:21,817 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-23 11:54:21,817 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-23 11:54:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:21,819 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-23 11:54:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-23 11:54:21,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:21,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:21,820 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-23 11:54:21,820 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-23 11:54:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:21,822 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-23 11:54:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-23 11:54:21,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:21,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:21,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:21,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 11:54:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-23 11:54:21,824 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 85 [2018-11-23 11:54:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:21,824 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-23 11:54:21,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:54:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-23 11:54:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:54:21,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:21,825 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:21,825 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:21,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:21,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1648082556, now seen corresponding path program 25 times [2018-11-23 11:54:21,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:21,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:21,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:21,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:21,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:22,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {12677#true} call ULTIMATE.init(); {12677#true} is VALID [2018-11-23 11:54:22,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {12677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12677#true} is VALID [2018-11-23 11:54:22,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {12677#true} assume true; {12677#true} is VALID [2018-11-23 11:54:22,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12677#true} {12677#true} #63#return; {12677#true} is VALID [2018-11-23 11:54:22,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {12677#true} call #t~ret8 := main(); {12677#true} is VALID [2018-11-23 11:54:22,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {12677#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12679#(= main_~a~0 0)} is VALID [2018-11-23 11:54:22,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {12679#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12679#(= main_~a~0 0)} is VALID [2018-11-23 11:54:22,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {12679#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12680#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:22,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {12680#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12680#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:22,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {12680#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12681#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:22,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {12681#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12681#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:22,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {12681#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12682#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:22,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {12682#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12682#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:22,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {12682#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12683#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:22,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {12683#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12683#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:22,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {12683#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12684#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:22,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {12684#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12684#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:22,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {12684#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12685#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:22,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {12685#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12685#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:22,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {12685#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12686#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:22,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {12686#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12686#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:22,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {12686#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12687#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:22,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {12687#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12687#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:22,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {12687#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12688#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:22,420 INFO L273 TraceCheckUtils]: 24: Hoare triple {12688#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12688#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:22,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {12688#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12689#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:22,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {12689#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12689#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:22,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {12689#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:22,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {12690#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:22,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {12690#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12691#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:22,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {12691#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12691#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:22,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {12691#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12692#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:22,426 INFO L273 TraceCheckUtils]: 32: Hoare triple {12692#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12692#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:22,426 INFO L273 TraceCheckUtils]: 33: Hoare triple {12692#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:22,427 INFO L273 TraceCheckUtils]: 34: Hoare triple {12693#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12693#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:22,428 INFO L273 TraceCheckUtils]: 35: Hoare triple {12693#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12694#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:22,428 INFO L273 TraceCheckUtils]: 36: Hoare triple {12694#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12694#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:22,429 INFO L273 TraceCheckUtils]: 37: Hoare triple {12694#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12695#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:22,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {12695#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12695#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:22,430 INFO L273 TraceCheckUtils]: 39: Hoare triple {12695#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12696#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:22,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {12696#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12696#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:22,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {12696#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12697#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:22,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {12697#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12697#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:22,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {12697#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12698#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:22,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {12698#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12698#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:22,434 INFO L273 TraceCheckUtils]: 45: Hoare triple {12698#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12699#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:22,435 INFO L273 TraceCheckUtils]: 46: Hoare triple {12699#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12699#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:22,435 INFO L273 TraceCheckUtils]: 47: Hoare triple {12699#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12700#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:22,436 INFO L273 TraceCheckUtils]: 48: Hoare triple {12700#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12700#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:22,437 INFO L273 TraceCheckUtils]: 49: Hoare triple {12700#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12701#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:22,437 INFO L273 TraceCheckUtils]: 50: Hoare triple {12701#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12701#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:22,438 INFO L273 TraceCheckUtils]: 51: Hoare triple {12701#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12702#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:22,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {12702#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12702#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:22,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {12702#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12703#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:22,440 INFO L273 TraceCheckUtils]: 54: Hoare triple {12703#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12703#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:22,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {12703#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12704#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:22,441 INFO L273 TraceCheckUtils]: 56: Hoare triple {12704#(<= main_~a~0 25)} assume !(~a~0 < 100000); {12678#false} is VALID [2018-11-23 11:54:22,441 INFO L273 TraceCheckUtils]: 57: Hoare triple {12678#false} havoc ~i~0;~i~0 := 0; {12678#false} is VALID [2018-11-23 11:54:22,442 INFO L273 TraceCheckUtils]: 58: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,442 INFO L273 TraceCheckUtils]: 59: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,442 INFO L273 TraceCheckUtils]: 60: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,442 INFO L273 TraceCheckUtils]: 61: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,442 INFO L273 TraceCheckUtils]: 62: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,443 INFO L273 TraceCheckUtils]: 63: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,443 INFO L273 TraceCheckUtils]: 64: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,443 INFO L273 TraceCheckUtils]: 65: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 73: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,444 INFO L273 TraceCheckUtils]: 74: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 78: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 79: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 80: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 81: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 82: Hoare triple {12678#false} assume !(~i~0 < 100000); {12678#false} is VALID [2018-11-23 11:54:22,445 INFO L273 TraceCheckUtils]: 83: Hoare triple {12678#false} havoc ~x~0;~x~0 := 0; {12678#false} is VALID [2018-11-23 11:54:22,446 INFO L273 TraceCheckUtils]: 84: Hoare triple {12678#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {12678#false} is VALID [2018-11-23 11:54:22,446 INFO L256 TraceCheckUtils]: 85: Hoare triple {12678#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12678#false} is VALID [2018-11-23 11:54:22,446 INFO L273 TraceCheckUtils]: 86: Hoare triple {12678#false} ~cond := #in~cond; {12678#false} is VALID [2018-11-23 11:54:22,446 INFO L273 TraceCheckUtils]: 87: Hoare triple {12678#false} assume 0 == ~cond; {12678#false} is VALID [2018-11-23 11:54:22,446 INFO L273 TraceCheckUtils]: 88: Hoare triple {12678#false} assume !false; {12678#false} is VALID [2018-11-23 11:54:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:54:22,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:22,451 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 11:54:22,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:22,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:22,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {12677#true} call ULTIMATE.init(); {12677#true} is VALID [2018-11-23 11:54:22,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {12677#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12677#true} is VALID [2018-11-23 11:54:22,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {12677#true} assume true; {12677#true} is VALID [2018-11-23 11:54:22,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12677#true} {12677#true} #63#return; {12677#true} is VALID [2018-11-23 11:54:22,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {12677#true} call #t~ret8 := main(); {12677#true} is VALID [2018-11-23 11:54:22,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {12677#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12723#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:22,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {12723#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12723#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:22,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {12723#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12680#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:22,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {12680#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12680#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:22,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {12680#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12681#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:22,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {12681#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12681#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:22,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {12681#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12682#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:22,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {12682#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12682#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:22,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {12682#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12683#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:22,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {12683#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12683#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:22,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {12683#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12684#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:22,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {12684#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12684#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:22,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {12684#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12685#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:22,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {12685#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12685#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:22,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {12685#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12686#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:22,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {12686#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12686#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:22,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {12686#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12687#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:22,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {12687#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12687#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:22,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {12687#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12688#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:22,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {12688#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12688#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:22,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {12688#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12689#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:22,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {12689#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12689#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:22,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {12689#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12690#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:22,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {12690#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12690#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:22,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {12690#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12691#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:22,802 INFO L273 TraceCheckUtils]: 30: Hoare triple {12691#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12691#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:22,803 INFO L273 TraceCheckUtils]: 31: Hoare triple {12691#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12692#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:22,803 INFO L273 TraceCheckUtils]: 32: Hoare triple {12692#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12692#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:22,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {12692#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12693#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:22,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {12693#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12693#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:22,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {12693#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12694#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:22,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {12694#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12694#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:22,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {12694#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12695#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:22,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {12695#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12695#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:22,808 INFO L273 TraceCheckUtils]: 39: Hoare triple {12695#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12696#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:22,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {12696#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12696#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:22,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {12696#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12697#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:22,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {12697#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12697#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:22,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {12697#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12698#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:22,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {12698#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12698#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:22,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {12698#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12699#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:22,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {12699#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12699#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:22,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {12699#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12700#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:22,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {12700#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12700#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:22,814 INFO L273 TraceCheckUtils]: 49: Hoare triple {12700#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12701#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:22,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {12701#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12701#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:22,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {12701#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12702#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:22,816 INFO L273 TraceCheckUtils]: 52: Hoare triple {12702#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12702#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:22,817 INFO L273 TraceCheckUtils]: 53: Hoare triple {12702#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12703#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:22,817 INFO L273 TraceCheckUtils]: 54: Hoare triple {12703#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12703#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:22,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {12703#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12704#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:22,819 INFO L273 TraceCheckUtils]: 56: Hoare triple {12704#(<= main_~a~0 25)} assume !(~a~0 < 100000); {12678#false} is VALID [2018-11-23 11:54:22,819 INFO L273 TraceCheckUtils]: 57: Hoare triple {12678#false} havoc ~i~0;~i~0 := 0; {12678#false} is VALID [2018-11-23 11:54:22,819 INFO L273 TraceCheckUtils]: 58: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,819 INFO L273 TraceCheckUtils]: 59: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,819 INFO L273 TraceCheckUtils]: 60: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,820 INFO L273 TraceCheckUtils]: 62: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,820 INFO L273 TraceCheckUtils]: 63: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,820 INFO L273 TraceCheckUtils]: 64: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,821 INFO L273 TraceCheckUtils]: 65: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,821 INFO L273 TraceCheckUtils]: 66: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,821 INFO L273 TraceCheckUtils]: 67: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,821 INFO L273 TraceCheckUtils]: 68: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,822 INFO L273 TraceCheckUtils]: 69: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,822 INFO L273 TraceCheckUtils]: 70: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,822 INFO L273 TraceCheckUtils]: 71: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,823 INFO L273 TraceCheckUtils]: 74: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,823 INFO L273 TraceCheckUtils]: 76: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,823 INFO L273 TraceCheckUtils]: 77: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,823 INFO L273 TraceCheckUtils]: 79: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 80: Hoare triple {12678#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 81: Hoare triple {12678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 82: Hoare triple {12678#false} assume !(~i~0 < 100000); {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 83: Hoare triple {12678#false} havoc ~x~0;~x~0 := 0; {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 84: Hoare triple {12678#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L256 TraceCheckUtils]: 85: Hoare triple {12678#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 86: Hoare triple {12678#false} ~cond := #in~cond; {12678#false} is VALID [2018-11-23 11:54:22,824 INFO L273 TraceCheckUtils]: 87: Hoare triple {12678#false} assume 0 == ~cond; {12678#false} is VALID [2018-11-23 11:54:22,825 INFO L273 TraceCheckUtils]: 88: Hoare triple {12678#false} assume !false; {12678#false} is VALID [2018-11-23 11:54:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:54:22,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:54:22,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-11-23 11:54:22,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:22,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:54:22,924 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 11:54:22,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:54:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:54:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:54:22,925 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 29 states. [2018-11-23 11:54:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:23,650 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-11-23 11:54:23,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:54:23,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-11-23 11:54:23,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:54:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 92 transitions. [2018-11-23 11:54:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:54:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 92 transitions. [2018-11-23 11:54:23,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 92 transitions. [2018-11-23 11:54:23,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:23,757 INFO L225 Difference]: With dead ends: 134 [2018-11-23 11:54:23,757 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 11:54:23,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:54:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 11:54:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-23 11:54:23,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:23,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 96 states. [2018-11-23 11:54:23,800 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 96 states. [2018-11-23 11:54:23,800 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 96 states. [2018-11-23 11:54:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:23,802 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-23 11:54:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-11-23 11:54:23,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:23,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:23,802 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 97 states. [2018-11-23 11:54:23,802 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 97 states. [2018-11-23 11:54:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:23,804 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-23 11:54:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-11-23 11:54:23,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:23,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:23,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:23,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:54:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-11-23 11:54:23,806 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 89 [2018-11-23 11:54:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:23,807 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-11-23 11:54:23,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:54:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-23 11:54:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:54:23,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:23,808 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:23,808 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:23,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1843611418, now seen corresponding path program 26 times [2018-11-23 11:54:23,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:23,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:23,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:23,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:23,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:24,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2018-11-23 11:54:24,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {13506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13506#true} is VALID [2018-11-23 11:54:24,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2018-11-23 11:54:24,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #63#return; {13506#true} is VALID [2018-11-23 11:54:24,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret8 := main(); {13506#true} is VALID [2018-11-23 11:54:24,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13508#(= main_~a~0 0)} is VALID [2018-11-23 11:54:24,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {13508#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13508#(= main_~a~0 0)} is VALID [2018-11-23 11:54:24,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {13508#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13509#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:24,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {13509#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13509#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:24,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {13509#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13510#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:24,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {13510#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13510#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:24,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {13510#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13511#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:24,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {13511#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13511#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:24,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {13511#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13512#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:24,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {13512#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13512#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:24,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {13512#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13513#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:24,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {13513#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13513#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:24,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {13513#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13514#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:24,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {13514#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13514#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:24,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {13514#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13515#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:24,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {13515#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13515#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:24,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {13515#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13516#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:24,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {13516#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13516#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:24,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {13516#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13517#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:24,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {13517#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13517#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:24,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {13517#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13518#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:24,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {13518#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13518#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:24,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {13518#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13519#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:24,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {13519#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13519#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:24,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {13519#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13520#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:24,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {13520#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13520#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:24,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {13520#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13521#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:24,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {13521#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13521#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:24,955 INFO L273 TraceCheckUtils]: 33: Hoare triple {13521#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13522#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:24,956 INFO L273 TraceCheckUtils]: 34: Hoare triple {13522#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13522#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:24,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {13522#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13523#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:24,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {13523#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13523#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:24,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {13523#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13524#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:24,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {13524#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13524#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:24,962 INFO L273 TraceCheckUtils]: 39: Hoare triple {13524#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13525#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:24,962 INFO L273 TraceCheckUtils]: 40: Hoare triple {13525#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13525#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:24,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {13525#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13526#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:24,963 INFO L273 TraceCheckUtils]: 42: Hoare triple {13526#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13526#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:24,963 INFO L273 TraceCheckUtils]: 43: Hoare triple {13526#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13527#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:24,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {13527#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13527#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:24,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {13527#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13528#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:24,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {13528#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13528#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:24,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {13528#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13529#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:24,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {13529#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13529#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:24,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {13529#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13530#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:24,968 INFO L273 TraceCheckUtils]: 50: Hoare triple {13530#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13530#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:24,968 INFO L273 TraceCheckUtils]: 51: Hoare triple {13530#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13531#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:24,969 INFO L273 TraceCheckUtils]: 52: Hoare triple {13531#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13531#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:24,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {13531#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13532#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:24,970 INFO L273 TraceCheckUtils]: 54: Hoare triple {13532#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13532#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:24,971 INFO L273 TraceCheckUtils]: 55: Hoare triple {13532#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13533#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:24,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {13533#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13533#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:24,972 INFO L273 TraceCheckUtils]: 57: Hoare triple {13533#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13534#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:24,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {13534#(<= main_~a~0 26)} assume !(~a~0 < 100000); {13507#false} is VALID [2018-11-23 11:54:24,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {13507#false} havoc ~i~0;~i~0 := 0; {13507#false} is VALID [2018-11-23 11:54:24,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,974 INFO L273 TraceCheckUtils]: 63: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,974 INFO L273 TraceCheckUtils]: 64: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,974 INFO L273 TraceCheckUtils]: 65: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,975 INFO L273 TraceCheckUtils]: 66: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,975 INFO L273 TraceCheckUtils]: 67: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,975 INFO L273 TraceCheckUtils]: 68: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,975 INFO L273 TraceCheckUtils]: 70: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,976 INFO L273 TraceCheckUtils]: 71: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,976 INFO L273 TraceCheckUtils]: 72: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,976 INFO L273 TraceCheckUtils]: 73: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,976 INFO L273 TraceCheckUtils]: 74: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,976 INFO L273 TraceCheckUtils]: 75: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 76: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 77: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 78: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 79: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 80: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 81: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 82: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:24,977 INFO L273 TraceCheckUtils]: 83: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L273 TraceCheckUtils]: 84: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L273 TraceCheckUtils]: 85: Hoare triple {13507#false} havoc ~x~0;~x~0 := 0; {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L273 TraceCheckUtils]: 86: Hoare triple {13507#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L256 TraceCheckUtils]: 87: Hoare triple {13507#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L273 TraceCheckUtils]: 88: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L273 TraceCheckUtils]: 89: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2018-11-23 11:54:24,978 INFO L273 TraceCheckUtils]: 90: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2018-11-23 11:54:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:54:24,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:24,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 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 11:54:24,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:25,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:25,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:25,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:25,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {13506#true} call ULTIMATE.init(); {13506#true} is VALID [2018-11-23 11:54:25,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {13506#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13506#true} is VALID [2018-11-23 11:54:25,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {13506#true} assume true; {13506#true} is VALID [2018-11-23 11:54:25,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13506#true} {13506#true} #63#return; {13506#true} is VALID [2018-11-23 11:54:25,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {13506#true} call #t~ret8 := main(); {13506#true} is VALID [2018-11-23 11:54:25,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {13506#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13553#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:25,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {13553#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13553#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:25,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {13553#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13509#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:25,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {13509#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13509#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:25,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {13509#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13510#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:25,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {13510#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13510#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:25,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {13510#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13511#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:25,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {13511#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13511#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:25,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {13511#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13512#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:25,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {13512#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13512#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:25,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {13512#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13513#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:25,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {13513#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13513#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:25,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {13513#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13514#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:25,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {13514#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13514#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:25,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {13514#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13515#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:25,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {13515#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13515#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:25,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {13515#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13516#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:25,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {13516#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13516#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:25,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {13516#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13517#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:25,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {13517#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13517#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:25,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {13517#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13518#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:25,293 INFO L273 TraceCheckUtils]: 26: Hoare triple {13518#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13518#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:25,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {13518#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13519#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:25,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {13519#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13519#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:25,295 INFO L273 TraceCheckUtils]: 29: Hoare triple {13519#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13520#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:25,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {13520#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13520#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:25,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {13520#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13521#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:25,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {13521#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13521#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:25,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {13521#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13522#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:25,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {13522#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13522#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:25,299 INFO L273 TraceCheckUtils]: 35: Hoare triple {13522#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13523#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:25,299 INFO L273 TraceCheckUtils]: 36: Hoare triple {13523#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13523#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:25,300 INFO L273 TraceCheckUtils]: 37: Hoare triple {13523#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13524#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:25,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {13524#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13524#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:25,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {13524#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13525#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:25,302 INFO L273 TraceCheckUtils]: 40: Hoare triple {13525#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13525#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:25,303 INFO L273 TraceCheckUtils]: 41: Hoare triple {13525#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13526#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:25,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {13526#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13526#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:25,304 INFO L273 TraceCheckUtils]: 43: Hoare triple {13526#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13527#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:25,304 INFO L273 TraceCheckUtils]: 44: Hoare triple {13527#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13527#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:25,305 INFO L273 TraceCheckUtils]: 45: Hoare triple {13527#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13528#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:25,306 INFO L273 TraceCheckUtils]: 46: Hoare triple {13528#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13528#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:25,306 INFO L273 TraceCheckUtils]: 47: Hoare triple {13528#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13529#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:25,307 INFO L273 TraceCheckUtils]: 48: Hoare triple {13529#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13529#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:25,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {13529#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13530#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:25,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {13530#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13530#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:25,309 INFO L273 TraceCheckUtils]: 51: Hoare triple {13530#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13531#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:25,310 INFO L273 TraceCheckUtils]: 52: Hoare triple {13531#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13531#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:25,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {13531#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13532#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:25,311 INFO L273 TraceCheckUtils]: 54: Hoare triple {13532#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13532#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:25,312 INFO L273 TraceCheckUtils]: 55: Hoare triple {13532#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13533#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:25,312 INFO L273 TraceCheckUtils]: 56: Hoare triple {13533#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13533#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:25,313 INFO L273 TraceCheckUtils]: 57: Hoare triple {13533#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13534#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:25,314 INFO L273 TraceCheckUtils]: 58: Hoare triple {13534#(<= main_~a~0 26)} assume !(~a~0 < 100000); {13507#false} is VALID [2018-11-23 11:54:25,314 INFO L273 TraceCheckUtils]: 59: Hoare triple {13507#false} havoc ~i~0;~i~0 := 0; {13507#false} is VALID [2018-11-23 11:54:25,314 INFO L273 TraceCheckUtils]: 60: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,314 INFO L273 TraceCheckUtils]: 61: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,314 INFO L273 TraceCheckUtils]: 62: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,315 INFO L273 TraceCheckUtils]: 63: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,315 INFO L273 TraceCheckUtils]: 64: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,315 INFO L273 TraceCheckUtils]: 65: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,315 INFO L273 TraceCheckUtils]: 66: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,315 INFO L273 TraceCheckUtils]: 67: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,316 INFO L273 TraceCheckUtils]: 68: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,316 INFO L273 TraceCheckUtils]: 69: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,316 INFO L273 TraceCheckUtils]: 71: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,316 INFO L273 TraceCheckUtils]: 72: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,317 INFO L273 TraceCheckUtils]: 73: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,317 INFO L273 TraceCheckUtils]: 74: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,317 INFO L273 TraceCheckUtils]: 75: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,317 INFO L273 TraceCheckUtils]: 76: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,317 INFO L273 TraceCheckUtils]: 77: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,318 INFO L273 TraceCheckUtils]: 78: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,318 INFO L273 TraceCheckUtils]: 79: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,318 INFO L273 TraceCheckUtils]: 80: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {13507#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13507#false} is VALID [2018-11-23 11:54:25,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {13507#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L273 TraceCheckUtils]: 84: Hoare triple {13507#false} assume !(~i~0 < 100000); {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L273 TraceCheckUtils]: 85: Hoare triple {13507#false} havoc ~x~0;~x~0 := 0; {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L273 TraceCheckUtils]: 86: Hoare triple {13507#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L256 TraceCheckUtils]: 87: Hoare triple {13507#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L273 TraceCheckUtils]: 88: Hoare triple {13507#false} ~cond := #in~cond; {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L273 TraceCheckUtils]: 89: Hoare triple {13507#false} assume 0 == ~cond; {13507#false} is VALID [2018-11-23 11:54:25,319 INFO L273 TraceCheckUtils]: 90: Hoare triple {13507#false} assume !false; {13507#false} is VALID [2018-11-23 11:54:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:54:25,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:25,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:54:25,344 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 11:54:25,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:25,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:54:25,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:25,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:54:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:54:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:54:25,448 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 30 states. [2018-11-23 11:54:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:26,147 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-23 11:54:26,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:54:26,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 11:54:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:54:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 94 transitions. [2018-11-23 11:54:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:54:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 94 transitions. [2018-11-23 11:54:26,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 94 transitions. [2018-11-23 11:54:26,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:26,268 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:54:26,268 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:54:26,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:54:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:54:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-23 11:54:26,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:26,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 98 states. [2018-11-23 11:54:26,376 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 98 states. [2018-11-23 11:54:26,376 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 98 states. [2018-11-23 11:54:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:26,378 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-23 11:54:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-23 11:54:26,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:26,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:26,378 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 99 states. [2018-11-23 11:54:26,378 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 99 states. [2018-11-23 11:54:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:26,380 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-23 11:54:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-23 11:54:26,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:26,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:26,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:26,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:54:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-11-23 11:54:26,382 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 91 [2018-11-23 11:54:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:26,382 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-11-23 11:54:26,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:54:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-11-23 11:54:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:54:26,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:26,383 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:26,383 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:26,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 768286776, now seen corresponding path program 27 times [2018-11-23 11:54:26,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:26,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:27,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {14352#true} call ULTIMATE.init(); {14352#true} is VALID [2018-11-23 11:54:27,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {14352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14352#true} is VALID [2018-11-23 11:54:27,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {14352#true} assume true; {14352#true} is VALID [2018-11-23 11:54:27,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14352#true} {14352#true} #63#return; {14352#true} is VALID [2018-11-23 11:54:27,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {14352#true} call #t~ret8 := main(); {14352#true} is VALID [2018-11-23 11:54:27,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {14352#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14354#(= main_~a~0 0)} is VALID [2018-11-23 11:54:27,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {14354#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14354#(= main_~a~0 0)} is VALID [2018-11-23 11:54:27,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {14354#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14355#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:27,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {14355#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14355#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:27,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {14355#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14356#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:27,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {14356#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14356#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:27,105 INFO L273 TraceCheckUtils]: 11: Hoare triple {14356#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14357#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:27,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {14357#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14357#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:27,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {14357#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14358#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:27,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {14358#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14358#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:27,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {14358#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14359#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:27,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {14359#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14359#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:27,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {14359#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14360#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:27,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {14360#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14360#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:27,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {14360#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14361#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:27,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {14361#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14361#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:27,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {14361#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14362#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:27,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {14362#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14362#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:27,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {14362#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14363#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:27,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {14363#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14363#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:27,114 INFO L273 TraceCheckUtils]: 25: Hoare triple {14363#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14364#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:27,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {14364#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14364#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:27,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {14364#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14365#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:27,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {14365#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14365#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:27,116 INFO L273 TraceCheckUtils]: 29: Hoare triple {14365#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14366#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:27,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {14366#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14366#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:27,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {14366#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14367#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:27,118 INFO L273 TraceCheckUtils]: 32: Hoare triple {14367#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14367#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:27,119 INFO L273 TraceCheckUtils]: 33: Hoare triple {14367#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14368#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:27,120 INFO L273 TraceCheckUtils]: 34: Hoare triple {14368#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14368#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:27,120 INFO L273 TraceCheckUtils]: 35: Hoare triple {14368#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14369#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:27,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {14369#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14369#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:27,122 INFO L273 TraceCheckUtils]: 37: Hoare triple {14369#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14370#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:27,122 INFO L273 TraceCheckUtils]: 38: Hoare triple {14370#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14370#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:27,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {14370#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14371#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:27,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {14371#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14371#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:27,124 INFO L273 TraceCheckUtils]: 41: Hoare triple {14371#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14372#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:27,125 INFO L273 TraceCheckUtils]: 42: Hoare triple {14372#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14372#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:27,125 INFO L273 TraceCheckUtils]: 43: Hoare triple {14372#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14373#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:27,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {14373#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14373#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:27,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {14373#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14374#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:27,127 INFO L273 TraceCheckUtils]: 46: Hoare triple {14374#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14374#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:27,128 INFO L273 TraceCheckUtils]: 47: Hoare triple {14374#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14375#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:27,128 INFO L273 TraceCheckUtils]: 48: Hoare triple {14375#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14375#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:27,129 INFO L273 TraceCheckUtils]: 49: Hoare triple {14375#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14376#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:27,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {14376#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14376#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:27,131 INFO L273 TraceCheckUtils]: 51: Hoare triple {14376#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14377#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:27,131 INFO L273 TraceCheckUtils]: 52: Hoare triple {14377#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14377#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:27,132 INFO L273 TraceCheckUtils]: 53: Hoare triple {14377#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14378#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:27,132 INFO L273 TraceCheckUtils]: 54: Hoare triple {14378#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14378#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:27,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {14378#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14379#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:27,134 INFO L273 TraceCheckUtils]: 56: Hoare triple {14379#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14379#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:27,134 INFO L273 TraceCheckUtils]: 57: Hoare triple {14379#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14380#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:27,135 INFO L273 TraceCheckUtils]: 58: Hoare triple {14380#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14380#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:27,136 INFO L273 TraceCheckUtils]: 59: Hoare triple {14380#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14381#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:27,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {14381#(<= main_~a~0 27)} assume !(~a~0 < 100000); {14353#false} is VALID [2018-11-23 11:54:27,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {14353#false} havoc ~i~0;~i~0 := 0; {14353#false} is VALID [2018-11-23 11:54:27,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,137 INFO L273 TraceCheckUtils]: 65: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,138 INFO L273 TraceCheckUtils]: 66: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,138 INFO L273 TraceCheckUtils]: 67: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,138 INFO L273 TraceCheckUtils]: 70: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 73: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 76: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 77: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,139 INFO L273 TraceCheckUtils]: 78: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 79: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 81: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 82: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 83: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 84: Hoare triple {14353#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 85: Hoare triple {14353#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 86: Hoare triple {14353#false} assume !(~i~0 < 100000); {14353#false} is VALID [2018-11-23 11:54:27,140 INFO L273 TraceCheckUtils]: 87: Hoare triple {14353#false} havoc ~x~0;~x~0 := 0; {14353#false} is VALID [2018-11-23 11:54:27,141 INFO L273 TraceCheckUtils]: 88: Hoare triple {14353#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {14353#false} is VALID [2018-11-23 11:54:27,141 INFO L256 TraceCheckUtils]: 89: Hoare triple {14353#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14353#false} is VALID [2018-11-23 11:54:27,141 INFO L273 TraceCheckUtils]: 90: Hoare triple {14353#false} ~cond := #in~cond; {14353#false} is VALID [2018-11-23 11:54:27,141 INFO L273 TraceCheckUtils]: 91: Hoare triple {14353#false} assume 0 == ~cond; {14353#false} is VALID [2018-11-23 11:54:27,141 INFO L273 TraceCheckUtils]: 92: Hoare triple {14353#false} assume !false; {14353#false} is VALID [2018-11-23 11:54:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:54:27,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:27,147 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 11:54:27,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:30,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 11:54:30,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:30,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:31,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {14352#true} call ULTIMATE.init(); {14352#true} is VALID [2018-11-23 11:54:31,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {14352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14352#true} is VALID [2018-11-23 11:54:31,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {14352#true} assume true; {14352#true} is VALID [2018-11-23 11:54:31,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14352#true} {14352#true} #63#return; {14352#true} is VALID [2018-11-23 11:54:31,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {14352#true} call #t~ret8 := main(); {14352#true} is VALID [2018-11-23 11:54:31,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {14352#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14352#true} is VALID [2018-11-23 11:54:31,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,238 INFO L273 TraceCheckUtils]: 12: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 16: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 46: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,242 INFO L273 TraceCheckUtils]: 48: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 49: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 52: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 56: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,243 INFO L273 TraceCheckUtils]: 57: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,244 INFO L273 TraceCheckUtils]: 58: Hoare triple {14352#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {14352#true} is VALID [2018-11-23 11:54:31,244 INFO L273 TraceCheckUtils]: 59: Hoare triple {14352#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {14352#true} is VALID [2018-11-23 11:54:31,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {14352#true} assume !(~a~0 < 100000); {14352#true} is VALID [2018-11-23 11:54:31,244 INFO L273 TraceCheckUtils]: 61: Hoare triple {14352#true} havoc ~i~0;~i~0 := 0; {14568#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:31,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {14568#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14568#(<= main_~i~0 0)} is VALID [2018-11-23 11:54:31,245 INFO L273 TraceCheckUtils]: 63: Hoare triple {14568#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14575#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:31,245 INFO L273 TraceCheckUtils]: 64: Hoare triple {14575#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14575#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:31,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {14575#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14582#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:31,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {14582#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14582#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:31,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {14582#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14589#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:31,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {14589#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14589#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:31,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {14589#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14596#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:31,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {14596#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14596#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:31,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {14596#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:31,248 INFO L273 TraceCheckUtils]: 72: Hoare triple {14603#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:31,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {14603#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14610#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:31,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {14610#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14610#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:31,250 INFO L273 TraceCheckUtils]: 75: Hoare triple {14610#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14617#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:31,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {14617#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14617#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:31,251 INFO L273 TraceCheckUtils]: 77: Hoare triple {14617#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14624#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:31,252 INFO L273 TraceCheckUtils]: 78: Hoare triple {14624#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14624#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:31,252 INFO L273 TraceCheckUtils]: 79: Hoare triple {14624#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14631#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:31,253 INFO L273 TraceCheckUtils]: 80: Hoare triple {14631#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14631#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:31,254 INFO L273 TraceCheckUtils]: 81: Hoare triple {14631#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14638#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:31,254 INFO L273 TraceCheckUtils]: 82: Hoare triple {14638#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14638#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:31,255 INFO L273 TraceCheckUtils]: 83: Hoare triple {14638#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14645#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:31,255 INFO L273 TraceCheckUtils]: 84: Hoare triple {14645#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {14645#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:31,256 INFO L273 TraceCheckUtils]: 85: Hoare triple {14645#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14652#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:31,257 INFO L273 TraceCheckUtils]: 86: Hoare triple {14652#(<= main_~i~0 12)} assume !(~i~0 < 100000); {14353#false} is VALID [2018-11-23 11:54:31,257 INFO L273 TraceCheckUtils]: 87: Hoare triple {14353#false} havoc ~x~0;~x~0 := 0; {14353#false} is VALID [2018-11-23 11:54:31,257 INFO L273 TraceCheckUtils]: 88: Hoare triple {14353#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {14353#false} is VALID [2018-11-23 11:54:31,257 INFO L256 TraceCheckUtils]: 89: Hoare triple {14353#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {14353#false} is VALID [2018-11-23 11:54:31,257 INFO L273 TraceCheckUtils]: 90: Hoare triple {14353#false} ~cond := #in~cond; {14353#false} is VALID [2018-11-23 11:54:31,258 INFO L273 TraceCheckUtils]: 91: Hoare triple {14353#false} assume 0 == ~cond; {14353#false} is VALID [2018-11-23 11:54:31,258 INFO L273 TraceCheckUtils]: 92: Hoare triple {14353#false} assume !false; {14353#false} is VALID [2018-11-23 11:54:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2018-11-23 11:54:31,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:31,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 15] total 43 [2018-11-23 11:54:31,284 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 93 [2018-11-23 11:54:31,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:31,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:54:31,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:31,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:54:31,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:54:31,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:54:31,762 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 43 states. [2018-11-23 11:54:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,785 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-11-23 11:54:32,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:54:32,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 93 [2018-11-23 11:54:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:54:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 123 transitions. [2018-11-23 11:54:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:54:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 123 transitions. [2018-11-23 11:54:32,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 123 transitions. [2018-11-23 11:54:33,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:33,053 INFO L225 Difference]: With dead ends: 141 [2018-11-23 11:54:33,053 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 11:54:33,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:54:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 11:54:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-23 11:54:33,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:33,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-23 11:54:33,121 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-23 11:54:33,122 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-23 11:54:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:33,123 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-23 11:54:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-11-23 11:54:33,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:33,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:33,124 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-23 11:54:33,124 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-23 11:54:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:33,125 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-23 11:54:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-11-23 11:54:33,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:33,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:33,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:33,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:54:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-11-23 11:54:33,127 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 93 [2018-11-23 11:54:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:33,127 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-11-23 11:54:33,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:54:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-11-23 11:54:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:54:33,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:33,128 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:33,129 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:33,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1363612596, now seen corresponding path program 28 times [2018-11-23 11:54:33,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:33,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:33,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:33,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {15240#true} call ULTIMATE.init(); {15240#true} is VALID [2018-11-23 11:54:34,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {15240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15240#true} is VALID [2018-11-23 11:54:34,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {15240#true} assume true; {15240#true} is VALID [2018-11-23 11:54:34,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15240#true} {15240#true} #63#return; {15240#true} is VALID [2018-11-23 11:54:34,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {15240#true} call #t~ret8 := main(); {15240#true} is VALID [2018-11-23 11:54:34,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {15240#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15242#(= main_~a~0 0)} is VALID [2018-11-23 11:54:34,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {15242#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15242#(= main_~a~0 0)} is VALID [2018-11-23 11:54:34,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {15242#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15243#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:34,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {15243#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15243#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:34,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {15243#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15244#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:34,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {15244#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15244#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:34,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {15244#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15245#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:34,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {15245#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15245#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:34,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {15245#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15246#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:34,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {15246#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15246#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:34,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {15246#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15247#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:34,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {15247#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15247#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:34,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {15247#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15248#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:34,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {15248#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15248#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:34,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {15248#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15249#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:34,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {15249#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15249#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:34,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {15249#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15250#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:34,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {15250#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15250#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:34,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {15250#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15251#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:34,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {15251#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15251#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:34,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {15251#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15252#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:34,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {15252#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15252#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:34,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {15252#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15253#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:34,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {15253#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15253#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:34,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {15253#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15254#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:34,320 INFO L273 TraceCheckUtils]: 30: Hoare triple {15254#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15254#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:34,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {15254#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15255#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:34,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {15255#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15255#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:34,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {15255#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15256#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:34,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {15256#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15256#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:34,323 INFO L273 TraceCheckUtils]: 35: Hoare triple {15256#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15257#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:34,324 INFO L273 TraceCheckUtils]: 36: Hoare triple {15257#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15257#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:34,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {15257#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15258#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:34,325 INFO L273 TraceCheckUtils]: 38: Hoare triple {15258#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15258#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:34,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {15258#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15259#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:34,326 INFO L273 TraceCheckUtils]: 40: Hoare triple {15259#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15259#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:34,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {15259#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15260#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:34,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {15260#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15260#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:34,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {15260#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15261#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:34,329 INFO L273 TraceCheckUtils]: 44: Hoare triple {15261#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15261#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:34,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {15261#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15262#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:34,330 INFO L273 TraceCheckUtils]: 46: Hoare triple {15262#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15262#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:34,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {15262#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15263#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:34,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {15263#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15263#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:34,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {15263#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15264#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:34,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {15264#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15264#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:34,334 INFO L273 TraceCheckUtils]: 51: Hoare triple {15264#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15265#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:34,334 INFO L273 TraceCheckUtils]: 52: Hoare triple {15265#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15265#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:34,335 INFO L273 TraceCheckUtils]: 53: Hoare triple {15265#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15266#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:34,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {15266#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15266#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:34,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {15266#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15267#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:34,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {15267#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15267#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:34,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {15267#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15268#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:34,338 INFO L273 TraceCheckUtils]: 58: Hoare triple {15268#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15268#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:34,339 INFO L273 TraceCheckUtils]: 59: Hoare triple {15268#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15269#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:34,339 INFO L273 TraceCheckUtils]: 60: Hoare triple {15269#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15269#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:34,340 INFO L273 TraceCheckUtils]: 61: Hoare triple {15269#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15270#(<= main_~a~0 28)} is VALID [2018-11-23 11:54:34,340 INFO L273 TraceCheckUtils]: 62: Hoare triple {15270#(<= main_~a~0 28)} assume !(~a~0 < 100000); {15241#false} is VALID [2018-11-23 11:54:34,341 INFO L273 TraceCheckUtils]: 63: Hoare triple {15241#false} havoc ~i~0;~i~0 := 0; {15241#false} is VALID [2018-11-23 11:54:34,341 INFO L273 TraceCheckUtils]: 64: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,341 INFO L273 TraceCheckUtils]: 65: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,341 INFO L273 TraceCheckUtils]: 66: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,341 INFO L273 TraceCheckUtils]: 67: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,342 INFO L273 TraceCheckUtils]: 68: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,342 INFO L273 TraceCheckUtils]: 69: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,342 INFO L273 TraceCheckUtils]: 70: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,342 INFO L273 TraceCheckUtils]: 71: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,342 INFO L273 TraceCheckUtils]: 72: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,343 INFO L273 TraceCheckUtils]: 73: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,343 INFO L273 TraceCheckUtils]: 74: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,343 INFO L273 TraceCheckUtils]: 75: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,343 INFO L273 TraceCheckUtils]: 76: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,343 INFO L273 TraceCheckUtils]: 77: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 78: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 79: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 81: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 82: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 83: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 84: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 85: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,344 INFO L273 TraceCheckUtils]: 86: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 87: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 88: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 89: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {15241#false} assume !(~i~0 < 100000); {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 91: Hoare triple {15241#false} havoc ~x~0;~x~0 := 0; {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 92: Hoare triple {15241#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L256 TraceCheckUtils]: 93: Hoare triple {15241#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 94: Hoare triple {15241#false} ~cond := #in~cond; {15241#false} is VALID [2018-11-23 11:54:34,345 INFO L273 TraceCheckUtils]: 95: Hoare triple {15241#false} assume 0 == ~cond; {15241#false} is VALID [2018-11-23 11:54:34,346 INFO L273 TraceCheckUtils]: 96: Hoare triple {15241#false} assume !false; {15241#false} is VALID [2018-11-23 11:54:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 11:54:34,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:34,351 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 11:54:34,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:34,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:34,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:34,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {15240#true} call ULTIMATE.init(); {15240#true} is VALID [2018-11-23 11:54:34,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {15240#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15240#true} is VALID [2018-11-23 11:54:34,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {15240#true} assume true; {15240#true} is VALID [2018-11-23 11:54:34,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15240#true} {15240#true} #63#return; {15240#true} is VALID [2018-11-23 11:54:34,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {15240#true} call #t~ret8 := main(); {15240#true} is VALID [2018-11-23 11:54:34,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {15240#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {15289#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:34,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {15289#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15289#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:34,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {15289#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15243#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:34,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {15243#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15243#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {15243#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15244#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {15244#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15244#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:34,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {15244#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15245#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:34,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {15245#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15245#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:34,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {15245#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15246#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:34,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {15246#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15246#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:34,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {15246#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15247#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:34,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {15247#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15247#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:34,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {15247#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15248#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:34,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {15248#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15248#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:34,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {15248#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15249#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:34,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {15249#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15249#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:34,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {15249#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15250#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:34,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {15250#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15250#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:34,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {15250#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15251#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:34,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {15251#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15251#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:34,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {15251#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15252#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:34,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {15252#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15252#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {15252#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15253#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:34,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {15253#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15253#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:34,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {15253#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15254#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:34,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {15254#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15254#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:34,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {15254#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15255#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:34,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {15255#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15255#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:34,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {15255#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15256#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:34,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {15256#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15256#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:34,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {15256#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15257#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:34,700 INFO L273 TraceCheckUtils]: 36: Hoare triple {15257#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15257#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:34,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {15257#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15258#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:34,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {15258#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15258#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:34,701 INFO L273 TraceCheckUtils]: 39: Hoare triple {15258#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15259#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:34,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {15259#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15259#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:34,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {15259#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15260#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:34,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {15260#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15260#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:34,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {15260#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15261#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:34,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {15261#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15261#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 45: Hoare triple {15261#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15262#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:34,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {15262#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15262#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {15262#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15263#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:34,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {15263#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15263#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:34,707 INFO L273 TraceCheckUtils]: 49: Hoare triple {15263#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15264#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {15264#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15264#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:34,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {15264#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15265#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:34,709 INFO L273 TraceCheckUtils]: 52: Hoare triple {15265#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15265#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:34,710 INFO L273 TraceCheckUtils]: 53: Hoare triple {15265#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15266#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:34,710 INFO L273 TraceCheckUtils]: 54: Hoare triple {15266#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15266#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:34,711 INFO L273 TraceCheckUtils]: 55: Hoare triple {15266#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15267#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:34,712 INFO L273 TraceCheckUtils]: 56: Hoare triple {15267#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15267#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:34,712 INFO L273 TraceCheckUtils]: 57: Hoare triple {15267#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15268#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:34,713 INFO L273 TraceCheckUtils]: 58: Hoare triple {15268#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15268#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:34,714 INFO L273 TraceCheckUtils]: 59: Hoare triple {15268#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15269#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:34,714 INFO L273 TraceCheckUtils]: 60: Hoare triple {15269#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {15269#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:34,715 INFO L273 TraceCheckUtils]: 61: Hoare triple {15269#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {15270#(<= main_~a~0 28)} is VALID [2018-11-23 11:54:34,715 INFO L273 TraceCheckUtils]: 62: Hoare triple {15270#(<= main_~a~0 28)} assume !(~a~0 < 100000); {15241#false} is VALID [2018-11-23 11:54:34,716 INFO L273 TraceCheckUtils]: 63: Hoare triple {15241#false} havoc ~i~0;~i~0 := 0; {15241#false} is VALID [2018-11-23 11:54:34,716 INFO L273 TraceCheckUtils]: 64: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,716 INFO L273 TraceCheckUtils]: 65: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,716 INFO L273 TraceCheckUtils]: 66: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,717 INFO L273 TraceCheckUtils]: 67: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,717 INFO L273 TraceCheckUtils]: 68: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,717 INFO L273 TraceCheckUtils]: 69: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,718 INFO L273 TraceCheckUtils]: 70: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,718 INFO L273 TraceCheckUtils]: 71: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,718 INFO L273 TraceCheckUtils]: 72: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,718 INFO L273 TraceCheckUtils]: 73: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,718 INFO L273 TraceCheckUtils]: 74: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 75: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 76: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 81: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 82: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 83: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 84: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 85: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 86: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,720 INFO L273 TraceCheckUtils]: 87: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 88: Hoare triple {15241#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 89: Hoare triple {15241#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 90: Hoare triple {15241#false} assume !(~i~0 < 100000); {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 91: Hoare triple {15241#false} havoc ~x~0;~x~0 := 0; {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 92: Hoare triple {15241#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L256 TraceCheckUtils]: 93: Hoare triple {15241#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {15241#false} is VALID [2018-11-23 11:54:34,721 INFO L273 TraceCheckUtils]: 94: Hoare triple {15241#false} ~cond := #in~cond; {15241#false} is VALID [2018-11-23 11:54:34,722 INFO L273 TraceCheckUtils]: 95: Hoare triple {15241#false} assume 0 == ~cond; {15241#false} is VALID [2018-11-23 11:54:34,722 INFO L273 TraceCheckUtils]: 96: Hoare triple {15241#false} assume !false; {15241#false} is VALID [2018-11-23 11:54:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 11:54:34,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:34,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:54:34,759 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 11:54:34,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:34,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:54:35,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:35,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:54:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:54:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:54:35,058 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 32 states. [2018-11-23 11:54:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:35,693 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2018-11-23 11:54:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:54:35,693 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 11:54:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2018-11-23 11:54:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:54:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 98 transitions. [2018-11-23 11:54:35,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 98 transitions. [2018-11-23 11:54:35,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:35,795 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:54:35,796 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 11:54:35,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:54:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 11:54:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-23 11:54:35,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:35,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-23 11:54:35,857 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-23 11:54:35,857 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-23 11:54:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:35,859 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-11-23 11:54:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-11-23 11:54:35,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:35,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:35,859 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-23 11:54:35,860 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-23 11:54:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:35,861 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-11-23 11:54:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-11-23 11:54:35,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:35,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:35,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:35,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:54:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-11-23 11:54:35,864 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 97 [2018-11-23 11:54:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:35,864 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-11-23 11:54:35,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:54:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-11-23 11:54:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:54:35,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:35,865 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:35,865 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:35,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1557979566, now seen corresponding path program 29 times [2018-11-23 11:54:35,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:35,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:35,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:37,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {16139#true} call ULTIMATE.init(); {16139#true} is VALID [2018-11-23 11:54:37,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {16139#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16139#true} is VALID [2018-11-23 11:54:37,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {16139#true} assume true; {16139#true} is VALID [2018-11-23 11:54:37,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16139#true} {16139#true} #63#return; {16139#true} is VALID [2018-11-23 11:54:37,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {16139#true} call #t~ret8 := main(); {16139#true} is VALID [2018-11-23 11:54:37,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {16139#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16141#(= main_~a~0 0)} is VALID [2018-11-23 11:54:37,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {16141#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16141#(= main_~a~0 0)} is VALID [2018-11-23 11:54:37,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {16141#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16142#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:37,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {16142#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16142#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:37,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {16142#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16143#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:37,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {16143#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16143#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:37,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {16143#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16144#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:37,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {16144#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16144#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:37,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {16144#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16145#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:37,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {16145#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16145#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:37,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {16145#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16146#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:37,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {16146#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16146#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:37,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {16146#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16147#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:37,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {16147#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16147#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:37,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {16147#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16148#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:37,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {16148#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16148#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:37,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {16148#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16149#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:37,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {16149#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16149#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:37,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {16149#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16150#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:37,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {16150#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16150#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:37,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {16150#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16151#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:37,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {16151#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16151#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:37,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {16151#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16152#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:37,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {16152#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16152#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:37,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {16152#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16153#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:37,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {16153#(<= main_~a~0 12)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16153#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:37,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {16153#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16154#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:37,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {16154#(<= main_~a~0 13)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16154#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:37,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {16154#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16155#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:37,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {16155#(<= main_~a~0 14)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16155#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:37,229 INFO L273 TraceCheckUtils]: 35: Hoare triple {16155#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16156#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:37,229 INFO L273 TraceCheckUtils]: 36: Hoare triple {16156#(<= main_~a~0 15)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16156#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:37,230 INFO L273 TraceCheckUtils]: 37: Hoare triple {16156#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16157#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:37,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {16157#(<= main_~a~0 16)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16157#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:37,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {16157#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16158#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:37,232 INFO L273 TraceCheckUtils]: 40: Hoare triple {16158#(<= main_~a~0 17)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16158#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:37,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {16158#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16159#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:37,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {16159#(<= main_~a~0 18)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16159#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:37,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {16159#(<= main_~a~0 18)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16160#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:37,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {16160#(<= main_~a~0 19)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16160#(<= main_~a~0 19)} is VALID [2018-11-23 11:54:37,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {16160#(<= main_~a~0 19)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16161#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:37,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {16161#(<= main_~a~0 20)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16161#(<= main_~a~0 20)} is VALID [2018-11-23 11:54:37,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {16161#(<= main_~a~0 20)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16162#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:37,237 INFO L273 TraceCheckUtils]: 48: Hoare triple {16162#(<= main_~a~0 21)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16162#(<= main_~a~0 21)} is VALID [2018-11-23 11:54:37,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {16162#(<= main_~a~0 21)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16163#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:37,238 INFO L273 TraceCheckUtils]: 50: Hoare triple {16163#(<= main_~a~0 22)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16163#(<= main_~a~0 22)} is VALID [2018-11-23 11:54:37,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {16163#(<= main_~a~0 22)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16164#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:37,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {16164#(<= main_~a~0 23)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16164#(<= main_~a~0 23)} is VALID [2018-11-23 11:54:37,240 INFO L273 TraceCheckUtils]: 53: Hoare triple {16164#(<= main_~a~0 23)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16165#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:37,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {16165#(<= main_~a~0 24)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16165#(<= main_~a~0 24)} is VALID [2018-11-23 11:54:37,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {16165#(<= main_~a~0 24)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16166#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:37,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {16166#(<= main_~a~0 25)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16166#(<= main_~a~0 25)} is VALID [2018-11-23 11:54:37,243 INFO L273 TraceCheckUtils]: 57: Hoare triple {16166#(<= main_~a~0 25)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16167#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:37,243 INFO L273 TraceCheckUtils]: 58: Hoare triple {16167#(<= main_~a~0 26)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16167#(<= main_~a~0 26)} is VALID [2018-11-23 11:54:37,244 INFO L273 TraceCheckUtils]: 59: Hoare triple {16167#(<= main_~a~0 26)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16168#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:37,244 INFO L273 TraceCheckUtils]: 60: Hoare triple {16168#(<= main_~a~0 27)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16168#(<= main_~a~0 27)} is VALID [2018-11-23 11:54:37,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {16168#(<= main_~a~0 27)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16169#(<= main_~a~0 28)} is VALID [2018-11-23 11:54:37,246 INFO L273 TraceCheckUtils]: 62: Hoare triple {16169#(<= main_~a~0 28)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~a~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {16169#(<= main_~a~0 28)} is VALID [2018-11-23 11:54:37,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {16169#(<= main_~a~0 28)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {16170#(<= main_~a~0 29)} is VALID [2018-11-23 11:54:37,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {16170#(<= main_~a~0 29)} assume !(~a~0 < 100000); {16140#false} is VALID [2018-11-23 11:54:37,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {16140#false} havoc ~i~0;~i~0 := 0; {16140#false} is VALID [2018-11-23 11:54:37,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,248 INFO L273 TraceCheckUtils]: 72: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,249 INFO L273 TraceCheckUtils]: 76: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,250 INFO L273 TraceCheckUtils]: 78: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,250 INFO L273 TraceCheckUtils]: 79: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,251 INFO L273 TraceCheckUtils]: 80: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,251 INFO L273 TraceCheckUtils]: 81: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,251 INFO L273 TraceCheckUtils]: 82: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,251 INFO L273 TraceCheckUtils]: 83: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,251 INFO L273 TraceCheckUtils]: 84: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,252 INFO L273 TraceCheckUtils]: 85: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,252 INFO L273 TraceCheckUtils]: 86: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,252 INFO L273 TraceCheckUtils]: 87: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,252 INFO L273 TraceCheckUtils]: 88: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,252 INFO L273 TraceCheckUtils]: 89: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,252 INFO L273 TraceCheckUtils]: 90: Hoare triple {16140#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {16140#false} is VALID [2018-11-23 11:54:37,253 INFO L273 TraceCheckUtils]: 91: Hoare triple {16140#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16140#false} is VALID [2018-11-23 11:54:37,253 INFO L273 TraceCheckUtils]: 92: Hoare triple {16140#false} assume !(~i~0 < 100000); {16140#false} is VALID [2018-11-23 11:54:37,253 INFO L273 TraceCheckUtils]: 93: Hoare triple {16140#false} havoc ~x~0;~x~0 := 0; {16140#false} is VALID [2018-11-23 11:54:37,253 INFO L273 TraceCheckUtils]: 94: Hoare triple {16140#false} assume !!(~x~0 < 100000);call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {16140#false} is VALID [2018-11-23 11:54:37,253 INFO L256 TraceCheckUtils]: 95: Hoare triple {16140#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {16140#false} is VALID [2018-11-23 11:54:37,253 INFO L273 TraceCheckUtils]: 96: Hoare triple {16140#false} ~cond := #in~cond; {16140#false} is VALID [2018-11-23 11:54:37,254 INFO L273 TraceCheckUtils]: 97: Hoare triple {16140#false} assume 0 == ~cond; {16140#false} is VALID [2018-11-23 11:54:37,254 INFO L273 TraceCheckUtils]: 98: Hoare triple {16140#false} assume !false; {16140#false} is VALID [2018-11-23 11:54:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-23 11:54:37,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:37,262 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 11:54:37,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1