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_copy4_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,614 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,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,646 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,647 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,648 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,651 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,651 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,651 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,740 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i [2018-11-23 11:51:45,810 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b78dfb0f/e203b4fb2c724862ba5d0d0fef55b7b5/FLAG2e8269f83 [2018-11-23 11:51:46,293 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:46,293 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i [2018-11-23 11:51:46,299 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b78dfb0f/e203b4fb2c724862ba5d0d0fef55b7b5/FLAG2e8269f83 [2018-11-23 11:51:46,638 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b78dfb0f/e203b4fb2c724862ba5d0d0fef55b7b5 [2018-11-23 11:51:46,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,656 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,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49987597 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,659 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,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,905 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,913 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,962 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,998 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,999 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,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:47,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:47,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:47,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:47,010 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:47,018 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:47,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:47,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:47,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:47,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:47,040 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:47,040 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:47,043 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:47,043 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:47,067 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:47,075 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:47,077 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:47,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:47,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:47,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:47,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:47,082 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,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:47,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:47,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:47,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:47,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:48,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:48,181 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:51:48,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48 BoogieIcfgContainer [2018-11-23 11:51:48,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:48,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:48,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:48,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:48,190 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:48,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eacea7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,190 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:48,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eacea7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:48, skipping insertion in model container [2018-11-23 11:51:48,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:48" (3/3) ... [2018-11-23 11:51:48,193 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_false-unreach-call_ground.i [2018-11-23 11:51:48,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:48,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:48,225 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:48,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:48,264 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:48,264 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:48,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:48,265 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:48,265 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:48,265 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:48,265 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:48,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 11:51:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:51:48,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1010407240, now seen corresponding path program 1 times [2018-11-23 11:51:48,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 11:51:48,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 11:51:48,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 11:51:48,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2018-11-23 11:51:48,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2018-11-23 11:51:48,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {39#true} is VALID [2018-11-23 11:51:48,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 11:51:48,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} havoc ~i~0;~i~0 := 0; {40#false} is VALID [2018-11-23 11:51:48,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:51:48,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-23 11:51:48,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:51:48,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-23 11:51:48,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:51:48,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-23 11:51:48,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume !(~i~0 < 100000); {40#false} is VALID [2018-11-23 11:51:48,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} havoc ~x~0;~x~0 := 0; {40#false} is VALID [2018-11-23 11:51:48,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {40#false} is VALID [2018-11-23 11:51:48,537 INFO L256 TraceCheckUtils]: 17: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {40#false} is VALID [2018-11-23 11:51:48,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 11:51:48,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 11:51:48,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 11:51:48,542 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,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,551 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 11:51:48,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,659 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 11:51:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,811 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-23 11:51:48,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,811 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 11:51:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 11:51:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-23 11:51:48,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2018-11-23 11:51:49,083 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:51:49,095 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:51:49,095 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:51:49,099 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:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:51:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:51:49,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:51:49,145 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:51:49,145 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:51:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,151 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:51:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:51:49,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,153 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:51:49,153 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:51:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,158 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:51:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:51:49,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:51:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:51:49,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 11:51:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,173 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:51:49,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:51:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:51:49,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:49,175 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash 555030978, now seen corresponding path program 1 times [2018-11-23 11:51:49,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-23 11:51:49,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {231#true} is VALID [2018-11-23 11:51:49,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-23 11:51:49,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #105#return; {231#true} is VALID [2018-11-23 11:51:49,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret14 := main(); {231#true} is VALID [2018-11-23 11:51:49,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {233#(= main_~a~0 0)} is VALID [2018-11-23 11:51:49,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~a~0 0)} assume !(~a~0 < 100000); {232#false} is VALID [2018-11-23 11:51:49,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#false} havoc ~i~0;~i~0 := 0; {232#false} is VALID [2018-11-23 11:51:49,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:51:49,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {232#false} ~i~0 := 0; {232#false} is VALID [2018-11-23 11:51:49,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:51:49,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {232#false} ~i~0 := 0; {232#false} is VALID [2018-11-23 11:51:49,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:51:49,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {232#false} ~i~0 := 0; {232#false} is VALID [2018-11-23 11:51:49,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {232#false} assume !(~i~0 < 100000); {232#false} is VALID [2018-11-23 11:51:49,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#false} havoc ~x~0;~x~0 := 0; {232#false} is VALID [2018-11-23 11:51:49,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {232#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {232#false} is VALID [2018-11-23 11:51:49,400 INFO L256 TraceCheckUtils]: 17: Hoare triple {232#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {232#false} is VALID [2018-11-23 11:51:49,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2018-11-23 11:51:49,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2018-11-23 11:51:49,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-23 11:51:49,403 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:49,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:51:49,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,571 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-23 11:51:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,922 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 11:51:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:51:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:51:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:51:49,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 11:51:50,158 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:51:50,161 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:51:50,161 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:51:50,162 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,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:51:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 11:51:50,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 11:51:50,183 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 11:51:50,183 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 11:51:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,186 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:51:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:51:50,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,187 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 11:51:50,187 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 11:51:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,190 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:51:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:51:50,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:51:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 11:51:50,194 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2018-11-23 11:51:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,195 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 11:51:50,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 11:51:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:51:50,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1099948320, now seen corresponding path program 1 times [2018-11-23 11:51:50,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2018-11-23 11:51:50,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {423#true} is VALID [2018-11-23 11:51:50,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2018-11-23 11:51:50,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #105#return; {423#true} is VALID [2018-11-23 11:51:50,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret14 := main(); {423#true} is VALID [2018-11-23 11:51:50,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {423#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {423#true} is VALID [2018-11-23 11:51:50,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {423#true} is VALID [2018-11-23 11:51:50,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {423#true} is VALID [2018-11-23 11:51:50,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {423#true} assume !(~a~0 < 100000); {423#true} is VALID [2018-11-23 11:51:50,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {423#true} havoc ~i~0;~i~0 := 0; {425#(= main_~i~0 0)} is VALID [2018-11-23 11:51:50,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {425#(= main_~i~0 0)} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:51:50,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {424#false} ~i~0 := 0; {424#false} is VALID [2018-11-23 11:51:50,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {424#false} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:51:50,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {424#false} ~i~0 := 0; {424#false} is VALID [2018-11-23 11:51:50,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {424#false} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:51:50,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {424#false} ~i~0 := 0; {424#false} is VALID [2018-11-23 11:51:50,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {424#false} assume !(~i~0 < 100000); {424#false} is VALID [2018-11-23 11:51:50,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {424#false} havoc ~x~0;~x~0 := 0; {424#false} is VALID [2018-11-23 11:51:50,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {424#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {424#false} is VALID [2018-11-23 11:51:50,301 INFO L256 TraceCheckUtils]: 19: Hoare triple {424#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {424#false} is VALID [2018-11-23 11:51:50,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {424#false} ~cond := #in~cond; {424#false} is VALID [2018-11-23 11:51:50,301 INFO L273 TraceCheckUtils]: 21: Hoare triple {424#false} assume 0 == ~cond; {424#false} is VALID [2018-11-23 11:51:50,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {424#false} assume !false; {424#false} is VALID [2018-11-23 11:51:50,303 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:50,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:50,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:50,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:51:50,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:50,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,339 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2018-11-23 11:51:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,582 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 11:51:50,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 11:51:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 11:51:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2018-11-23 11:51:50,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2018-11-23 11:51:50,773 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:51:50,776 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:51:50,776 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:51:50,776 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,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:51:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-11-23 11:51:50,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2018-11-23 11:51:50,820 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2018-11-23 11:51:50,820 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2018-11-23 11:51:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,824 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 11:51:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 11:51:50,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,825 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2018-11-23 11:51:50,826 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2018-11-23 11:51:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,829 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 11:51:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 11:51:50,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:51:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 11:51:50,833 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 23 [2018-11-23 11:51:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,833 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 11:51:50,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:51:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:50,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:50,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1986876888, now seen corresponding path program 1 times [2018-11-23 11:51:50,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 11:51:50,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {644#true} is VALID [2018-11-23 11:51:50,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 11:51:50,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #105#return; {644#true} is VALID [2018-11-23 11:51:50,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret14 := main(); {644#true} is VALID [2018-11-23 11:51:50,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {646#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {646#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {646#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {647#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:50,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {647#(<= main_~a~0 1)} assume !(~a~0 < 100000); {645#false} is VALID [2018-11-23 11:51:50,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {645#false} havoc ~i~0;~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:50,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {645#false} is VALID [2018-11-23 11:51:50,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {645#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {645#false} is VALID [2018-11-23 11:51:50,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:50,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:50,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {645#false} is VALID [2018-11-23 11:51:50,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {645#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {645#false} is VALID [2018-11-23 11:51:50,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:50,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:50,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {645#false} is VALID [2018-11-23 11:51:50,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {645#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {645#false} is VALID [2018-11-23 11:51:50,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:50,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:50,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {645#false} is VALID [2018-11-23 11:51:50,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {645#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {645#false} is VALID [2018-11-23 11:51:50,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:50,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {645#false} havoc ~x~0;~x~0 := 0; {645#false} is VALID [2018-11-23 11:51:50,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {645#false} is VALID [2018-11-23 11:51:50,952 INFO L256 TraceCheckUtils]: 27: Hoare triple {645#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {645#false} is VALID [2018-11-23 11:51:50,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2018-11-23 11:51:50,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {645#false} assume 0 == ~cond; {645#false} is VALID [2018-11-23 11:51:50,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 11:51:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:50,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:50,955 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,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 11:51:51,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {644#true} is VALID [2018-11-23 11:51:51,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 11:51:51,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #105#return; {644#true} is VALID [2018-11-23 11:51:51,572 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret14 := main(); {644#true} is VALID [2018-11-23 11:51:51,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {666#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {666#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {666#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,575 INFO L273 TraceCheckUtils]: 7: Hoare triple {666#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {647#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {647#(<= main_~a~0 1)} assume !(~a~0 < 100000); {645#false} is VALID [2018-11-23 11:51:51,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {645#false} havoc ~i~0;~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:51,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {645#false} is VALID [2018-11-23 11:51:51,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {645#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {645#false} is VALID [2018-11-23 11:51:51,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:51,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:51,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {645#false} is VALID [2018-11-23 11:51:51,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {645#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {645#false} is VALID [2018-11-23 11:51:51,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {645#false} is VALID [2018-11-23 11:51:51,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {645#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {645#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {645#false} ~i~0 := 0; {645#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {645#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {645#false} is VALID [2018-11-23 11:51:51,582 INFO L273 TraceCheckUtils]: 23: Hoare triple {645#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {645#false} is VALID [2018-11-23 11:51:51,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {645#false} assume !(~i~0 < 100000); {645#false} is VALID [2018-11-23 11:51:51,583 INFO L273 TraceCheckUtils]: 25: Hoare triple {645#false} havoc ~x~0;~x~0 := 0; {645#false} is VALID [2018-11-23 11:51:51,583 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {645#false} is VALID [2018-11-23 11:51:51,584 INFO L256 TraceCheckUtils]: 27: Hoare triple {645#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {645#false} is VALID [2018-11-23 11:51:51,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {645#false} ~cond := #in~cond; {645#false} is VALID [2018-11-23 11:51:51,584 INFO L273 TraceCheckUtils]: 29: Hoare triple {645#false} assume 0 == ~cond; {645#false} is VALID [2018-11-23 11:51:51,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 11:51:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:51,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:51,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:51:51,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:51,696 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:51,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:51,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,697 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2018-11-23 11:51:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,905 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 11:51:51,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:51:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:51:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:51:51,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 11:51:52,095 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:51:52,098 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:51:52,098 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:51:52,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:51:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 11:51:52,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 11:51:52,124 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 11:51:52,125 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 11:51:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,127 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:51:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:51:52,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,127 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 11:51:52,128 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 11:51:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,130 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:51:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-23 11:51:52,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:51:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 11:51:52,134 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 31 [2018-11-23 11:51:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,134 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 11:51:52,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 11:51:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:51:52,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,136 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:52,136 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1213402486, now seen corresponding path program 2 times [2018-11-23 11:51:52,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2018-11-23 11:51:52,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {970#true} is VALID [2018-11-23 11:51:52,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-23 11:51:52,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {970#true} {970#true} #105#return; {970#true} is VALID [2018-11-23 11:51:52,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {970#true} call #t~ret14 := main(); {970#true} is VALID [2018-11-23 11:51:52,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {970#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {972#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {972#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {972#(= main_~a~0 0)} is VALID [2018-11-23 11:51:52,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {972#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {973#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {973#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {973#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {973#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {974#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#(<= main_~a~0 2)} assume !(~a~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {971#false} havoc ~i~0;~i~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {971#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {971#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {971#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {971#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 17: Hoare triple {971#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {971#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {971#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {971#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {971#false} is VALID [2018-11-23 11:51:52,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {971#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {971#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 27: Hoare triple {971#false} havoc ~x~0;~x~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 28: Hoare triple {971#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {971#false} is VALID [2018-11-23 11:51:52,263 INFO L256 TraceCheckUtils]: 29: Hoare triple {971#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {971#false} is VALID [2018-11-23 11:51:52,263 INFO L273 TraceCheckUtils]: 30: Hoare triple {971#false} ~cond := #in~cond; {971#false} is VALID [2018-11-23 11:51:52,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {971#false} assume 0 == ~cond; {971#false} is VALID [2018-11-23 11:51:52,264 INFO L273 TraceCheckUtils]: 32: Hoare triple {971#false} assume !false; {971#false} is VALID [2018-11-23 11:51:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:51:52,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:52,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2018-11-23 11:51:52,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {970#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {970#true} is VALID [2018-11-23 11:51:52,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-23 11:51:52,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {970#true} {970#true} #105#return; {970#true} is VALID [2018-11-23 11:51:52,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {970#true} call #t~ret14 := main(); {970#true} is VALID [2018-11-23 11:51:52,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {970#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {970#true} is VALID [2018-11-23 11:51:52,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {970#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {970#true} is VALID [2018-11-23 11:51:52,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {970#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {970#true} is VALID [2018-11-23 11:51:52,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {970#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {970#true} is VALID [2018-11-23 11:51:52,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {970#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {970#true} is VALID [2018-11-23 11:51:52,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {970#true} assume !(~a~0 < 100000); {970#true} is VALID [2018-11-23 11:51:52,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {970#true} havoc ~i~0;~i~0 := 0; {970#true} is VALID [2018-11-23 11:51:52,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {970#true} is VALID [2018-11-23 11:51:52,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {970#true} is VALID [2018-11-23 11:51:52,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {970#true} assume !(~i~0 < 100000); {970#true} is VALID [2018-11-23 11:51:52,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {970#true} ~i~0 := 0; {1023#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {1023#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1023#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {1023#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1030#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {1030#(<= main_~i~0 1)} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,495 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {971#false} is VALID [2018-11-23 11:51:52,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {971#false} is VALID [2018-11-23 11:51:52,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,495 INFO L273 TraceCheckUtils]: 23: Hoare triple {971#false} ~i~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {971#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {971#false} is VALID [2018-11-23 11:51:52,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {971#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {971#false} is VALID [2018-11-23 11:51:52,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {971#false} assume !(~i~0 < 100000); {971#false} is VALID [2018-11-23 11:51:52,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {971#false} havoc ~x~0;~x~0 := 0; {971#false} is VALID [2018-11-23 11:51:52,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {971#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {971#false} is VALID [2018-11-23 11:51:52,497 INFO L256 TraceCheckUtils]: 29: Hoare triple {971#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {971#false} is VALID [2018-11-23 11:51:52,497 INFO L273 TraceCheckUtils]: 30: Hoare triple {971#false} ~cond := #in~cond; {971#false} is VALID [2018-11-23 11:51:52,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {971#false} assume 0 == ~cond; {971#false} is VALID [2018-11-23 11:51:52,498 INFO L273 TraceCheckUtils]: 32: Hoare triple {971#false} assume !false; {971#false} is VALID [2018-11-23 11:51:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:51:52,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:51:52,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 11:51:52,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:52,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:52,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:52,626 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2018-11-23 11:51:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,070 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-23 11:51:53,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:53,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 11:51:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:51:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:51:53,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2018-11-23 11:51:53,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,272 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:51:53,272 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:51:53,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:51:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-11-23 11:51:53,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2018-11-23 11:51:53,315 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2018-11-23 11:51:53,316 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2018-11-23 11:51:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,319 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 11:51:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 11:51:53,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,320 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2018-11-23 11:51:53,321 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2018-11-23 11:51:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,323 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-23 11:51:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-11-23 11:51:53,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:51:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-23 11:51:53,327 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 33 [2018-11-23 11:51:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,327 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-23 11:51:53,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-23 11:51:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:51:53,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,329 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:53,330 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1157629812, now seen corresponding path program 3 times [2018-11-23 11:51:53,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2018-11-23 11:51:53,505 INFO L273 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1366#true} is VALID [2018-11-23 11:51:53,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2018-11-23 11:51:53,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #105#return; {1366#true} is VALID [2018-11-23 11:51:53,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret14 := main(); {1366#true} is VALID [2018-11-23 11:51:53,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1368#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {1368#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1368#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1369#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1369#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {1369#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1370#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {1370#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1370#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {1370#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1371#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {1371#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1367#false} is VALID [2018-11-23 11:51:53,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {1367#false} havoc ~i~0;~i~0 := 0; {1367#false} is VALID [2018-11-23 11:51:53,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1367#false} is VALID [2018-11-23 11:51:53,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2018-11-23 11:51:53,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1367#false} is VALID [2018-11-23 11:51:53,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1367#false} is VALID [2018-11-23 11:51:53,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:51:53,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2018-11-23 11:51:53,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1367#false} is VALID [2018-11-23 11:51:53,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1367#false} is VALID [2018-11-23 11:51:53,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1367#false} is VALID [2018-11-23 11:51:53,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1367#false} is VALID [2018-11-23 11:51:53,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:51:53,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2018-11-23 11:51:53,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1367#false} is VALID [2018-11-23 11:51:53,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {1367#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1367#false} is VALID [2018-11-23 11:51:53,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1367#false} is VALID [2018-11-23 11:51:53,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {1367#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1367#false} is VALID [2018-11-23 11:51:53,525 INFO L273 TraceCheckUtils]: 30: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:51:53,525 INFO L273 TraceCheckUtils]: 31: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2018-11-23 11:51:53,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1367#false} is VALID [2018-11-23 11:51:53,526 INFO L273 TraceCheckUtils]: 33: Hoare triple {1367#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1367#false} is VALID [2018-11-23 11:51:53,526 INFO L273 TraceCheckUtils]: 34: Hoare triple {1367#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1367#false} is VALID [2018-11-23 11:51:53,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {1367#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1367#false} is VALID [2018-11-23 11:51:53,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {1367#false} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:51:53,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {1367#false} havoc ~x~0;~x~0 := 0; {1367#false} is VALID [2018-11-23 11:51:53,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {1367#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1367#false} is VALID [2018-11-23 11:51:53,528 INFO L256 TraceCheckUtils]: 39: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1367#false} is VALID [2018-11-23 11:51:53,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2018-11-23 11:51:53,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2018-11-23 11:51:53,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2018-11-23 11:51:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:51:53,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,533 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:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:53,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:51:53,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2018-11-23 11:51:53,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1366#true} is VALID [2018-11-23 11:51:53,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2018-11-23 11:51:53,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #105#return; {1366#true} is VALID [2018-11-23 11:51:53,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret14 := main(); {1366#true} is VALID [2018-11-23 11:51:53,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1366#true} is VALID [2018-11-23 11:51:53,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {1366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1366#true} is VALID [2018-11-23 11:51:53,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {1366#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2018-11-23 11:51:53,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {1366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1366#true} is VALID [2018-11-23 11:51:53,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {1366#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2018-11-23 11:51:53,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {1366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1366#true} is VALID [2018-11-23 11:51:53,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {1366#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1366#true} is VALID [2018-11-23 11:51:53,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {1366#true} assume !(~a~0 < 100000); {1366#true} is VALID [2018-11-23 11:51:53,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {1366#true} havoc ~i~0;~i~0 := 0; {1366#true} is VALID [2018-11-23 11:51:53,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1366#true} is VALID [2018-11-23 11:51:53,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1366#true} is VALID [2018-11-23 11:51:53,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1366#true} is VALID [2018-11-23 11:51:53,774 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1366#true} is VALID [2018-11-23 11:51:53,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#true} assume !(~i~0 < 100000); {1366#true} is VALID [2018-11-23 11:51:53,775 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#true} ~i~0 := 0; {1366#true} is VALID [2018-11-23 11:51:53,775 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1366#true} is VALID [2018-11-23 11:51:53,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {1366#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1366#true} is VALID [2018-11-23 11:51:53,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1366#true} is VALID [2018-11-23 11:51:53,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {1366#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1366#true} is VALID [2018-11-23 11:51:53,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {1366#true} assume !(~i~0 < 100000); {1366#true} is VALID [2018-11-23 11:51:53,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {1366#true} ~i~0 := 0; {1366#true} is VALID [2018-11-23 11:51:53,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1366#true} is VALID [2018-11-23 11:51:53,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {1366#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1366#true} is VALID [2018-11-23 11:51:53,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {1366#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1366#true} is VALID [2018-11-23 11:51:53,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {1366#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1366#true} is VALID [2018-11-23 11:51:53,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {1366#true} assume !(~i~0 < 100000); {1366#true} is VALID [2018-11-23 11:51:53,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {1366#true} ~i~0 := 0; {1468#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {1468#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1468#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {1468#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1475#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,784 INFO L273 TraceCheckUtils]: 34: Hoare triple {1475#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1475#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {1475#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1482#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {1482#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 11:51:53,786 INFO L273 TraceCheckUtils]: 37: Hoare triple {1367#false} havoc ~x~0;~x~0 := 0; {1367#false} is VALID [2018-11-23 11:51:53,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {1367#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1367#false} is VALID [2018-11-23 11:51:53,786 INFO L256 TraceCheckUtils]: 39: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1367#false} is VALID [2018-11-23 11:51:53,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2018-11-23 11:51:53,787 INFO L273 TraceCheckUtils]: 41: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2018-11-23 11:51:53,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2018-11-23 11:51:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 11:51:53,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:51:53,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-23 11:51:53,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:53,901 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:53,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:53,902 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 9 states. [2018-11-23 11:51:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,514 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 11:51:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:54,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-23 11:51:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2018-11-23 11:51:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2018-11-23 11:51:54,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2018-11-23 11:51:54,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,723 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:51:54,723 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:51:54,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:51:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-11-23 11:51:54,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 58 states. [2018-11-23 11:51:54,755 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 58 states. [2018-11-23 11:51:54,756 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 58 states. [2018-11-23 11:51:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,758 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 11:51:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-23 11:51:54,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,759 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 63 states. [2018-11-23 11:51:54,760 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 63 states. [2018-11-23 11:51:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,762 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 11:51:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-23 11:51:54,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:51:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-23 11:51:54,766 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 43 [2018-11-23 11:51:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,766 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-23 11:51:54,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-11-23 11:51:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 11:51:54,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,768 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:54,768 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1571995614, now seen corresponding path program 4 times [2018-11-23 11:51:54,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2018-11-23 11:51:54,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1856#true} is VALID [2018-11-23 11:51:54,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2018-11-23 11:51:54,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #105#return; {1856#true} is VALID [2018-11-23 11:51:54,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret14 := main(); {1856#true} is VALID [2018-11-23 11:51:54,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {1856#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1858#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {1858#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1858#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {1858#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {1859#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {1860#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {1860#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {1861#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {1861#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1862#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {1862#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:54,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {1857#false} havoc ~i~0;~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:54,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1857#false} is VALID [2018-11-23 11:51:54,972 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2018-11-23 11:51:54,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1857#false} is VALID [2018-11-23 11:51:54,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2018-11-23 11:51:54,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1857#false} is VALID [2018-11-23 11:51:54,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2018-11-23 11:51:54,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:54,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:54,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1857#false} is VALID [2018-11-23 11:51:54,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {1857#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1857#false} is VALID [2018-11-23 11:51:54,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1857#false} is VALID [2018-11-23 11:51:54,974 INFO L273 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1857#false} is VALID [2018-11-23 11:51:54,975 INFO L273 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1857#false} is VALID [2018-11-23 11:51:54,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1857#false} is VALID [2018-11-23 11:51:54,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:54,975 INFO L273 TraceCheckUtils]: 31: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:54,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1857#false} is VALID [2018-11-23 11:51:54,976 INFO L273 TraceCheckUtils]: 33: Hoare triple {1857#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1857#false} is VALID [2018-11-23 11:51:54,976 INFO L273 TraceCheckUtils]: 34: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1857#false} is VALID [2018-11-23 11:51:54,976 INFO L273 TraceCheckUtils]: 35: Hoare triple {1857#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1857#false} is VALID [2018-11-23 11:51:54,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1857#false} is VALID [2018-11-23 11:51:54,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {1857#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1857#false} is VALID [2018-11-23 11:51:54,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:54,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:54,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1857#false} is VALID [2018-11-23 11:51:54,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {1857#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1857#false} is VALID [2018-11-23 11:51:54,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1857#false} is VALID [2018-11-23 11:51:54,978 INFO L273 TraceCheckUtils]: 43: Hoare triple {1857#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1857#false} is VALID [2018-11-23 11:51:54,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1857#false} is VALID [2018-11-23 11:51:54,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {1857#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1857#false} is VALID [2018-11-23 11:51:54,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:54,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {1857#false} havoc ~x~0;~x~0 := 0; {1857#false} is VALID [2018-11-23 11:51:54,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {1857#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1857#false} is VALID [2018-11-23 11:51:54,979 INFO L256 TraceCheckUtils]: 49: Hoare triple {1857#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1857#false} is VALID [2018-11-23 11:51:54,979 INFO L273 TraceCheckUtils]: 50: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2018-11-23 11:51:54,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2018-11-23 11:51:54,979 INFO L273 TraceCheckUtils]: 52: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2018-11-23 11:51:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:51:54,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,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 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:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:55,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:55,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:55,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {1856#true} call ULTIMATE.init(); {1856#true} is VALID [2018-11-23 11:51:55,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1856#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1856#true} is VALID [2018-11-23 11:51:55,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1856#true} assume true; {1856#true} is VALID [2018-11-23 11:51:55,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1856#true} {1856#true} #105#return; {1856#true} is VALID [2018-11-23 11:51:55,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1856#true} call #t~ret14 := main(); {1856#true} is VALID [2018-11-23 11:51:55,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {1856#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1881#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:55,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {1881#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1881#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:55,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {1881#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {1859#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1859#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {1860#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1860#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {1860#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {1861#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1861#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {1861#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1862#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:55,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {1862#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:55,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {1857#false} havoc ~i~0;~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:55,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1857#false} is VALID [2018-11-23 11:51:55,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2018-11-23 11:51:55,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1857#false} is VALID [2018-11-23 11:51:55,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2018-11-23 11:51:55,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1857#false} is VALID [2018-11-23 11:51:55,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {1857#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1857#false} is VALID [2018-11-23 11:51:55,325 INFO L273 TraceCheckUtils]: 22: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:55,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:55,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1857#false} is VALID [2018-11-23 11:51:55,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {1857#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1857#false} is VALID [2018-11-23 11:51:55,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1857#false} is VALID [2018-11-23 11:51:55,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {1857#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1857#false} is VALID [2018-11-23 11:51:55,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1857#false} is VALID [2018-11-23 11:51:55,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {1857#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1857#false} is VALID [2018-11-23 11:51:55,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:55,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:55,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1857#false} is VALID [2018-11-23 11:51:55,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {1857#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1857#false} is VALID [2018-11-23 11:51:55,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1857#false} is VALID [2018-11-23 11:51:55,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {1857#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1857#false} is VALID [2018-11-23 11:51:55,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1857#false} is VALID [2018-11-23 11:51:55,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {1857#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1857#false} is VALID [2018-11-23 11:51:55,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:55,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {1857#false} ~i~0 := 0; {1857#false} is VALID [2018-11-23 11:51:55,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1857#false} is VALID [2018-11-23 11:51:55,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {1857#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1857#false} is VALID [2018-11-23 11:51:55,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1857#false} is VALID [2018-11-23 11:51:55,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {1857#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1857#false} is VALID [2018-11-23 11:51:55,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {1857#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {1857#false} is VALID [2018-11-23 11:51:55,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {1857#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {1857#false} is VALID [2018-11-23 11:51:55,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {1857#false} assume !(~i~0 < 100000); {1857#false} is VALID [2018-11-23 11:51:55,332 INFO L273 TraceCheckUtils]: 47: Hoare triple {1857#false} havoc ~x~0;~x~0 := 0; {1857#false} is VALID [2018-11-23 11:51:55,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {1857#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {1857#false} is VALID [2018-11-23 11:51:55,333 INFO L256 TraceCheckUtils]: 49: Hoare triple {1857#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {1857#false} is VALID [2018-11-23 11:51:55,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {1857#false} ~cond := #in~cond; {1857#false} is VALID [2018-11-23 11:51:55,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {1857#false} assume 0 == ~cond; {1857#false} is VALID [2018-11-23 11:51:55,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {1857#false} assume !false; {1857#false} is VALID [2018-11-23 11:51:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:51:55,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:55,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:55,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 11:51:55,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:55,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:55,443 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:51:55,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:55,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:55,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:55,445 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 8 states. [2018-11-23 11:51:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,983 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-11-23 11:51:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:55,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 11:51:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 11:51:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 11:51:55,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 11:51:56,081 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:51:56,083 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:51:56,083 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:51:56,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:51:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 11:51:56,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:56,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 11:51:56,127 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 11:51:56,127 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 11:51:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,129 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 11:51:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:51:56,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,130 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 11:51:56,130 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 11:51:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,133 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-11-23 11:51:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-23 11:51:56,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:56,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:56,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:56,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:51:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-11-23 11:51:56,135 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 53 [2018-11-23 11:51:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:56,136 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-11-23 11:51:56,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-23 11:51:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:51:56,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:56,137 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:56,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:56,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 161238336, now seen corresponding path program 5 times [2018-11-23 11:51:56,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:56,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2385#true} is VALID [2018-11-23 11:51:56,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {2385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2385#true} is VALID [2018-11-23 11:51:56,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2018-11-23 11:51:56,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #105#return; {2385#true} is VALID [2018-11-23 11:51:56,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret14 := main(); {2385#true} is VALID [2018-11-23 11:51:56,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {2385#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2387#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {2387#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2387#(= main_~a~0 0)} is VALID [2018-11-23 11:51:56,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {2387#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2388#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {2388#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2388#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:56,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {2388#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2389#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {2389#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2389#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:56,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {2389#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2390#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {2390#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2390#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:56,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {2390#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2391#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {2391#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2391#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:56,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {2391#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2392#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:56,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {2392#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:56,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {2386#false} havoc ~i~0;~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:56,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2386#false} is VALID [2018-11-23 11:51:56,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {2386#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2386#false} is VALID [2018-11-23 11:51:56,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2386#false} is VALID [2018-11-23 11:51:56,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {2386#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2386#false} is VALID [2018-11-23 11:51:56,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2386#false} is VALID [2018-11-23 11:51:56,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {2386#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2386#false} is VALID [2018-11-23 11:51:56,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:56,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:56,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2386#false} is VALID [2018-11-23 11:51:56,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {2386#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2386#false} is VALID [2018-11-23 11:51:56,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2386#false} is VALID [2018-11-23 11:51:56,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {2386#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2386#false} is VALID [2018-11-23 11:51:56,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {2386#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {2386#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2386#false} is VALID [2018-11-23 11:51:56,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {2386#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {2386#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 40: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 41: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {2386#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2386#false} is VALID [2018-11-23 11:51:56,574 INFO L273 TraceCheckUtils]: 44: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2386#false} is VALID [2018-11-23 11:51:56,575 INFO L273 TraceCheckUtils]: 45: Hoare triple {2386#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2386#false} is VALID [2018-11-23 11:51:56,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2386#false} is VALID [2018-11-23 11:51:56,575 INFO L273 TraceCheckUtils]: 47: Hoare triple {2386#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2386#false} is VALID [2018-11-23 11:51:56,575 INFO L273 TraceCheckUtils]: 48: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:56,575 INFO L273 TraceCheckUtils]: 49: Hoare triple {2386#false} havoc ~x~0;~x~0 := 0; {2386#false} is VALID [2018-11-23 11:51:56,575 INFO L273 TraceCheckUtils]: 50: Hoare triple {2386#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2386#false} is VALID [2018-11-23 11:51:56,576 INFO L256 TraceCheckUtils]: 51: Hoare triple {2386#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {2386#false} is VALID [2018-11-23 11:51:56,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {2386#false} ~cond := #in~cond; {2386#false} is VALID [2018-11-23 11:51:56,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {2386#false} assume 0 == ~cond; {2386#false} is VALID [2018-11-23 11:51:56,576 INFO L273 TraceCheckUtils]: 54: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2018-11-23 11:51:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 11:51:56,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:56,579 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:56,596 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:59,228 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:59,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {2385#true} call ULTIMATE.init(); {2385#true} is VALID [2018-11-23 11:51:59,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {2385#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2385#true} is VALID [2018-11-23 11:51:59,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {2385#true} assume true; {2385#true} is VALID [2018-11-23 11:51:59,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2385#true} {2385#true} #105#return; {2385#true} is VALID [2018-11-23 11:51:59,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {2385#true} call #t~ret14 := main(); {2385#true} is VALID [2018-11-23 11:51:59,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {2385#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2385#true} is VALID [2018-11-23 11:51:59,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {2385#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2385#true} is VALID [2018-11-23 11:51:59,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:51:59,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {2385#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2385#true} is VALID [2018-11-23 11:51:59,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:51:59,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {2385#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2385#true} is VALID [2018-11-23 11:51:59,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:51:59,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {2385#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2385#true} is VALID [2018-11-23 11:51:59,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:51:59,366 INFO L273 TraceCheckUtils]: 14: Hoare triple {2385#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2385#true} is VALID [2018-11-23 11:51:59,366 INFO L273 TraceCheckUtils]: 15: Hoare triple {2385#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2385#true} is VALID [2018-11-23 11:51:59,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {2385#true} assume !(~a~0 < 100000); {2385#true} is VALID [2018-11-23 11:51:59,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {2385#true} havoc ~i~0;~i~0 := 0; {2447#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {2447#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2447#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {2447#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2454#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {2454#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2454#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {2454#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2461#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {2461#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2461#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {2461#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2468#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,370 INFO L273 TraceCheckUtils]: 24: Hoare triple {2468#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:59,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:59,370 INFO L273 TraceCheckUtils]: 26: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2386#false} is VALID [2018-11-23 11:51:59,371 INFO L273 TraceCheckUtils]: 27: Hoare triple {2386#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2386#false} is VALID [2018-11-23 11:51:59,371 INFO L273 TraceCheckUtils]: 28: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2386#false} is VALID [2018-11-23 11:51:59,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {2386#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2386#false} is VALID [2018-11-23 11:51:59,371 INFO L273 TraceCheckUtils]: 30: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2386#false} is VALID [2018-11-23 11:51:59,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {2386#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2386#false} is VALID [2018-11-23 11:51:59,372 INFO L273 TraceCheckUtils]: 32: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:59,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:59,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2386#false} is VALID [2018-11-23 11:51:59,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {2386#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2386#false} is VALID [2018-11-23 11:51:59,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2386#false} is VALID [2018-11-23 11:51:59,373 INFO L273 TraceCheckUtils]: 37: Hoare triple {2386#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2386#false} is VALID [2018-11-23 11:51:59,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2386#false} is VALID [2018-11-23 11:51:59,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {2386#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2386#false} is VALID [2018-11-23 11:51:59,374 INFO L273 TraceCheckUtils]: 40: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:59,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {2386#false} ~i~0 := 0; {2386#false} is VALID [2018-11-23 11:51:59,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2386#false} is VALID [2018-11-23 11:51:59,374 INFO L273 TraceCheckUtils]: 43: Hoare triple {2386#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2386#false} is VALID [2018-11-23 11:51:59,375 INFO L273 TraceCheckUtils]: 44: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2386#false} is VALID [2018-11-23 11:51:59,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {2386#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2386#false} is VALID [2018-11-23 11:51:59,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {2386#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2386#false} is VALID [2018-11-23 11:51:59,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {2386#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2386#false} is VALID [2018-11-23 11:51:59,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {2386#false} assume !(~i~0 < 100000); {2386#false} is VALID [2018-11-23 11:51:59,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {2386#false} havoc ~x~0;~x~0 := 0; {2386#false} is VALID [2018-11-23 11:51:59,376 INFO L273 TraceCheckUtils]: 50: Hoare triple {2386#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2386#false} is VALID [2018-11-23 11:51:59,376 INFO L256 TraceCheckUtils]: 51: Hoare triple {2386#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {2386#false} is VALID [2018-11-23 11:51:59,376 INFO L273 TraceCheckUtils]: 52: Hoare triple {2386#false} ~cond := #in~cond; {2386#false} is VALID [2018-11-23 11:51:59,376 INFO L273 TraceCheckUtils]: 53: Hoare triple {2386#false} assume 0 == ~cond; {2386#false} is VALID [2018-11-23 11:51:59,377 INFO L273 TraceCheckUtils]: 54: Hoare triple {2386#false} assume !false; {2386#false} is VALID [2018-11-23 11:51:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 11:51:59,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:51:59,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 11:51:59,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:59,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:59,449 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 12 states. [2018-11-23 11:52:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,091 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-11-23 11:52:00,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:52:00,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-23 11:52:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 11:52:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 11:52:00,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-23 11:52:00,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,270 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:52:00,270 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 11:52:00,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 11:52:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-11-23 11:52:00,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 70 states. [2018-11-23 11:52:00,309 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 70 states. [2018-11-23 11:52:00,309 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 70 states. [2018-11-23 11:52:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,311 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 11:52:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 11:52:00,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,312 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 75 states. [2018-11-23 11:52:00,312 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 75 states. [2018-11-23 11:52:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,314 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-23 11:52:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 11:52:00,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:52:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-11-23 11:52:00,317 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 55 [2018-11-23 11:52:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,317 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-11-23 11:52:00,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-11-23 11:52:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:52:00,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,318 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:00,319 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1745421270, now seen corresponding path program 6 times [2018-11-23 11:52:00,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {2986#true} is VALID [2018-11-23 11:52:00,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {2986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2986#true} is VALID [2018-11-23 11:52:00,665 INFO L273 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2018-11-23 11:52:00,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #105#return; {2986#true} is VALID [2018-11-23 11:52:00,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret14 := main(); {2986#true} is VALID [2018-11-23 11:52:00,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {2986#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2988#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {2988#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2988#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {2988#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2989#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {2989#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2989#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {2989#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2990#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {2990#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2990#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {2990#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2991#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {2991#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2991#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {2991#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2992#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {2992#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2992#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {2992#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2993#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {2993#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2993#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {2993#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2994#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {2994#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:00,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {2987#false} havoc ~i~0;~i~0 := 0; {2987#false} is VALID [2018-11-23 11:52:00,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2987#false} is VALID [2018-11-23 11:52:00,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {2987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#false} is VALID [2018-11-23 11:52:00,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2987#false} is VALID [2018-11-23 11:52:00,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {2987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#false} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2987#false} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 25: Hoare triple {2987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#false} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 26: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2987#false} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {2987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#false} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:52:00,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2987#false} is VALID [2018-11-23 11:52:00,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {2987#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2987#false} is VALID [2018-11-23 11:52:00,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2987#false} is VALID [2018-11-23 11:52:00,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {2987#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2987#false} is VALID [2018-11-23 11:52:00,692 INFO L273 TraceCheckUtils]: 34: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2987#false} is VALID [2018-11-23 11:52:00,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {2987#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2987#false} is VALID [2018-11-23 11:52:00,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2987#false} is VALID [2018-11-23 11:52:00,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {2987#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 38: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 49: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 50: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 55: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {2987#false} havoc ~x~0;~x~0 := 0; {2987#false} is VALID [2018-11-23 11:52:00,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2987#false} is VALID [2018-11-23 11:52:00,696 INFO L256 TraceCheckUtils]: 61: Hoare triple {2987#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {2987#false} is VALID [2018-11-23 11:52:00,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {2987#false} ~cond := #in~cond; {2987#false} is VALID [2018-11-23 11:52:00,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {2987#false} assume 0 == ~cond; {2987#false} is VALID [2018-11-23 11:52:00,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2018-11-23 11:52:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 11:52:00,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:00,707 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:01,200 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:52:01,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:01,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:01,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {2986#true} call ULTIMATE.init(); {2986#true} is VALID [2018-11-23 11:52:01,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {2986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2986#true} is VALID [2018-11-23 11:52:01,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {2986#true} assume true; {2986#true} is VALID [2018-11-23 11:52:01,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2986#true} {2986#true} #105#return; {2986#true} is VALID [2018-11-23 11:52:01,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {2986#true} call #t~ret14 := main(); {2986#true} is VALID [2018-11-23 11:52:01,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {2986#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2986#true} is VALID [2018-11-23 11:52:01,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {2986#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#true} is VALID [2018-11-23 11:52:01,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:52:01,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {2986#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#true} is VALID [2018-11-23 11:52:01,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:52:01,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {2986#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#true} is VALID [2018-11-23 11:52:01,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:52:01,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {2986#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#true} is VALID [2018-11-23 11:52:01,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:52:01,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {2986#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#true} is VALID [2018-11-23 11:52:01,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:52:01,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {2986#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2986#true} is VALID [2018-11-23 11:52:01,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {2986#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2986#true} is VALID [2018-11-23 11:52:01,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {2986#true} assume !(~a~0 < 100000); {2986#true} is VALID [2018-11-23 11:52:01,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {2986#true} havoc ~i~0;~i~0 := 0; {2986#true} is VALID [2018-11-23 11:52:01,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2986#true} is VALID [2018-11-23 11:52:01,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {2986#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#true} is VALID [2018-11-23 11:52:01,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2986#true} is VALID [2018-11-23 11:52:01,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {2986#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#true} is VALID [2018-11-23 11:52:01,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2986#true} is VALID [2018-11-23 11:52:01,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {2986#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#true} is VALID [2018-11-23 11:52:01,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {2986#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2986#true} is VALID [2018-11-23 11:52:01,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {2986#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#true} is VALID [2018-11-23 11:52:01,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {2986#true} assume !(~i~0 < 100000); {2986#true} is VALID [2018-11-23 11:52:01,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {2986#true} ~i~0 := 0; {3085#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {3085#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3085#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {3085#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3092#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {3092#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3092#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {3092#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3099#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {3099#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3099#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {3099#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3106#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,502 INFO L273 TraceCheckUtils]: 36: Hoare triple {3106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3106#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {3106#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3113#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {3113#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:01,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:52:01,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:01,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:01,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:01,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:01,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:01,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:01,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2987#false} is VALID [2018-11-23 11:52:01,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {2987#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2987#false} is VALID [2018-11-23 11:52:01,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:01,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {2987#false} ~i~0 := 0; {2987#false} is VALID [2018-11-23 11:52:01,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:01,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:01,507 INFO L273 TraceCheckUtils]: 52: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:01,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:01,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:01,507 INFO L273 TraceCheckUtils]: 55: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:01,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {2987#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {2987#false} is VALID [2018-11-23 11:52:01,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {2987#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {2987#false} is VALID [2018-11-23 11:52:01,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {2987#false} assume !(~i~0 < 100000); {2987#false} is VALID [2018-11-23 11:52:01,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {2987#false} havoc ~x~0;~x~0 := 0; {2987#false} is VALID [2018-11-23 11:52:01,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {2987#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {2987#false} is VALID [2018-11-23 11:52:01,508 INFO L256 TraceCheckUtils]: 61: Hoare triple {2987#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {2987#false} is VALID [2018-11-23 11:52:01,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {2987#false} ~cond := #in~cond; {2987#false} is VALID [2018-11-23 11:52:01,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {2987#false} assume 0 == ~cond; {2987#false} is VALID [2018-11-23 11:52:01,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {2987#false} assume !false; {2987#false} is VALID [2018-11-23 11:52:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 11:52:01,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:01,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:52:01,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-23 11:52:01,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:01,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:01,584 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:01,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:01,586 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 14 states. [2018-11-23 11:52:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,029 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 11:52:02,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:02,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-23 11:52:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2018-11-23 11:52:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2018-11-23 11:52:02,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2018-11-23 11:52:02,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,175 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:52:02,175 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:52:02,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:52:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-11-23 11:52:02,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:02,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 80 states. [2018-11-23 11:52:02,224 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 80 states. [2018-11-23 11:52:02,225 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 80 states. [2018-11-23 11:52:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,228 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:52:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:52:02,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,229 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 85 states. [2018-11-23 11:52:02,229 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 85 states. [2018-11-23 11:52:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,232 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:52:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:52:02,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:02,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:52:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-23 11:52:02,235 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 65 [2018-11-23 11:52:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:02,235 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-23 11:52:02,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-23 11:52:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:52:02,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:02,236 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:02,237 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:02,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash 268285676, now seen corresponding path program 7 times [2018-11-23 11:52:02,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-23 11:52:02,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3681#true} is VALID [2018-11-23 11:52:02,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:52:02,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #105#return; {3681#true} is VALID [2018-11-23 11:52:02,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret14 := main(); {3681#true} is VALID [2018-11-23 11:52:02,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {3681#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3683#(= main_~a~0 0)} is VALID [2018-11-23 11:52:02,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {3683#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3683#(= main_~a~0 0)} is VALID [2018-11-23 11:52:02,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {3683#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {3684#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {3684#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {3685#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {3685#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,443 INFO L273 TraceCheckUtils]: 12: Hoare triple {3686#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {3686#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {3687#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {3687#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {3688#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {3688#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {3689#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {3689#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3690#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:02,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {3682#false} havoc ~i~0;~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,463 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,463 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,464 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,464 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,464 INFO L273 TraceCheckUtils]: 33: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,465 INFO L273 TraceCheckUtils]: 34: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,465 INFO L273 TraceCheckUtils]: 35: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,465 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,467 INFO L273 TraceCheckUtils]: 45: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,468 INFO L273 TraceCheckUtils]: 48: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,468 INFO L273 TraceCheckUtils]: 49: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,468 INFO L273 TraceCheckUtils]: 50: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,468 INFO L273 TraceCheckUtils]: 53: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 54: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 55: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 56: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 57: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 58: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 63: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {3682#false} havoc ~x~0;~x~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 70: Hoare triple {3682#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {3682#false} is VALID [2018-11-23 11:52:02,472 INFO L256 TraceCheckUtils]: 71: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {3682#false} is VALID [2018-11-23 11:52:02,472 INFO L273 TraceCheckUtils]: 72: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-23 11:52:02,472 INFO L273 TraceCheckUtils]: 73: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2018-11-23 11:52:02,472 INFO L273 TraceCheckUtils]: 74: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-23 11:52:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:52:02,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:02,476 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:52:02,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:02,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-23 11:52:02,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3681#true} is VALID [2018-11-23 11:52:02,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:52:02,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #105#return; {3681#true} is VALID [2018-11-23 11:52:02,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret14 := main(); {3681#true} is VALID [2018-11-23 11:52:02,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {3681#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3709#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:02,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {3709#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3709#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:02,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {3709#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {3684#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3684#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {3684#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {3685#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3685#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {3685#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {3686#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3686#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {3686#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {3687#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3687#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {3687#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {3688#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3688#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {3688#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {3689#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3689#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {3689#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3690#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:02,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {3682#false} havoc ~i~0;~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3682#false} is VALID [2018-11-23 11:52:02,678 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3682#false} is VALID [2018-11-23 11:52:02,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 42: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {3682#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 45: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,680 INFO L273 TraceCheckUtils]: 48: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 50: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 51: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 52: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 53: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 54: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 55: Hoare triple {3682#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3682#false} is VALID [2018-11-23 11:52:02,681 INFO L273 TraceCheckUtils]: 56: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 57: Hoare triple {3682#false} ~i~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 58: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 59: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 60: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 61: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 62: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 63: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,682 INFO L273 TraceCheckUtils]: 64: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L273 TraceCheckUtils]: 65: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {3682#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L273 TraceCheckUtils]: 67: Hoare triple {3682#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L273 TraceCheckUtils]: 68: Hoare triple {3682#false} assume !(~i~0 < 100000); {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L273 TraceCheckUtils]: 69: Hoare triple {3682#false} havoc ~x~0;~x~0 := 0; {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L273 TraceCheckUtils]: 70: Hoare triple {3682#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {3682#false} is VALID [2018-11-23 11:52:02,683 INFO L256 TraceCheckUtils]: 71: Hoare triple {3682#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {3682#false} is VALID [2018-11-23 11:52:02,684 INFO L273 TraceCheckUtils]: 72: Hoare triple {3682#false} ~cond := #in~cond; {3682#false} is VALID [2018-11-23 11:52:02,684 INFO L273 TraceCheckUtils]: 73: Hoare triple {3682#false} assume 0 == ~cond; {3682#false} is VALID [2018-11-23 11:52:02,684 INFO L273 TraceCheckUtils]: 74: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-23 11:52:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:52:02,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:02,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:52:02,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 11:52:02,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:02,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:52:02,756 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:02,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:52:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:52:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:02,757 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 11 states. [2018-11-23 11:52:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,199 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-11-23 11:52:03,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:52:03,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 11:52:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 11:52:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 11:52:03,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-23 11:52:03,325 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:03,327 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:52:03,327 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 11:52:03,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 11:52:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 11:52:03,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:03,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 11:52:03,431 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 11:52:03,431 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 11:52:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,433 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 11:52:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-23 11:52:03,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,434 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 11:52:03,434 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 11:52:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,435 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-11-23 11:52:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-11-23 11:52:03,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:03,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:52:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-11-23 11:52:03,438 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 75 [2018-11-23 11:52:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:03,438 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-23 11:52:03,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:52:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-23 11:52:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 11:52:03,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:03,439 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:03,439 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:03,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1197147766, now seen corresponding path program 8 times [2018-11-23 11:52:03,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:03,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:03,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:03,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {4413#true} call ULTIMATE.init(); {4413#true} is VALID [2018-11-23 11:52:03,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {4413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4413#true} is VALID [2018-11-23 11:52:03,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {4413#true} assume true; {4413#true} is VALID [2018-11-23 11:52:03,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4413#true} {4413#true} #105#return; {4413#true} is VALID [2018-11-23 11:52:03,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {4413#true} call #t~ret14 := main(); {4413#true} is VALID [2018-11-23 11:52:03,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {4413#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4415#(= main_~a~0 0)} is VALID [2018-11-23 11:52:03,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {4415#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4415#(= main_~a~0 0)} is VALID [2018-11-23 11:52:03,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {4415#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {4416#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:03,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {4416#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {4417#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:03,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {4417#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {4418#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:03,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {4418#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {4419#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:03,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {4419#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {4420#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:03,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {4420#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {4421#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:03,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {4421#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {4422#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:03,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {4422#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4423#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:03,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {4423#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:03,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {4414#false} havoc ~i~0;~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:03,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:03,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:03,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:03,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:03,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:03,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:03,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:03,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:03,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:03,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:03,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:03,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:03,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:03,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:03,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 40: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 41: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 42: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 43: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 44: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:03,843 INFO L273 TraceCheckUtils]: 45: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:03,844 INFO L273 TraceCheckUtils]: 46: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:03,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:03,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:03,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:03,844 INFO L273 TraceCheckUtils]: 50: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:03,844 INFO L273 TraceCheckUtils]: 51: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:03,845 INFO L273 TraceCheckUtils]: 52: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:03,845 INFO L273 TraceCheckUtils]: 53: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:03,845 INFO L273 TraceCheckUtils]: 54: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:03,845 INFO L273 TraceCheckUtils]: 55: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:03,845 INFO L273 TraceCheckUtils]: 56: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:03,846 INFO L273 TraceCheckUtils]: 57: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:03,846 INFO L273 TraceCheckUtils]: 58: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:03,846 INFO L273 TraceCheckUtils]: 59: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:03,846 INFO L273 TraceCheckUtils]: 60: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:03,846 INFO L273 TraceCheckUtils]: 61: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:03,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:03,847 INFO L273 TraceCheckUtils]: 63: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:03,847 INFO L273 TraceCheckUtils]: 64: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:03,847 INFO L273 TraceCheckUtils]: 65: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:03,847 INFO L273 TraceCheckUtils]: 66: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:03,848 INFO L273 TraceCheckUtils]: 67: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:03,848 INFO L273 TraceCheckUtils]: 68: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:03,848 INFO L273 TraceCheckUtils]: 69: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:03,848 INFO L273 TraceCheckUtils]: 70: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:03,848 INFO L273 TraceCheckUtils]: 71: Hoare triple {4414#false} havoc ~x~0;~x~0 := 0; {4414#false} is VALID [2018-11-23 11:52:03,849 INFO L273 TraceCheckUtils]: 72: Hoare triple {4414#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {4414#false} is VALID [2018-11-23 11:52:03,849 INFO L256 TraceCheckUtils]: 73: Hoare triple {4414#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {4414#false} is VALID [2018-11-23 11:52:03,849 INFO L273 TraceCheckUtils]: 74: Hoare triple {4414#false} ~cond := #in~cond; {4414#false} is VALID [2018-11-23 11:52:03,849 INFO L273 TraceCheckUtils]: 75: Hoare triple {4414#false} assume 0 == ~cond; {4414#false} is VALID [2018-11-23 11:52:03,850 INFO L273 TraceCheckUtils]: 76: Hoare triple {4414#false} assume !false; {4414#false} is VALID [2018-11-23 11:52:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:52:03,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:03,857 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:52:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:03,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:03,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:03,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:04,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {4413#true} call ULTIMATE.init(); {4413#true} is VALID [2018-11-23 11:52:04,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {4413#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4413#true} is VALID [2018-11-23 11:52:04,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {4413#true} assume true; {4413#true} is VALID [2018-11-23 11:52:04,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4413#true} {4413#true} #105#return; {4413#true} is VALID [2018-11-23 11:52:04,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {4413#true} call #t~ret14 := main(); {4413#true} is VALID [2018-11-23 11:52:04,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {4413#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {4442#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:04,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {4442#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4442#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:04,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {4442#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {4416#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4416#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {4416#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {4417#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4417#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {4417#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {4418#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4418#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {4418#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {4419#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4419#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {4419#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {4420#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4420#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {4420#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {4421#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4421#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {4421#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,143 INFO L273 TraceCheckUtils]: 20: Hoare triple {4422#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4422#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {4422#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4423#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {4423#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {4414#false} havoc ~i~0;~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:04,145 INFO L273 TraceCheckUtils]: 29: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 31: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {4414#false} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {4414#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4414#false} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:04,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:04,147 INFO L273 TraceCheckUtils]: 42: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4414#false} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 45: Hoare triple {4414#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4414#false} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:04,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 49: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 50: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 51: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 53: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 54: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:04,149 INFO L273 TraceCheckUtils]: 55: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 56: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4414#false} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 57: Hoare triple {4414#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4414#false} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 58: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 59: Hoare triple {4414#false} ~i~0 := 0; {4414#false} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 60: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:04,150 INFO L273 TraceCheckUtils]: 61: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 62: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 63: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 64: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 66: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 67: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:04,151 INFO L273 TraceCheckUtils]: 68: Hoare triple {4414#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {4414#false} is VALID [2018-11-23 11:52:04,152 INFO L273 TraceCheckUtils]: 69: Hoare triple {4414#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {4414#false} is VALID [2018-11-23 11:52:04,152 INFO L273 TraceCheckUtils]: 70: Hoare triple {4414#false} assume !(~i~0 < 100000); {4414#false} is VALID [2018-11-23 11:52:04,152 INFO L273 TraceCheckUtils]: 71: Hoare triple {4414#false} havoc ~x~0;~x~0 := 0; {4414#false} is VALID [2018-11-23 11:52:04,152 INFO L273 TraceCheckUtils]: 72: Hoare triple {4414#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {4414#false} is VALID [2018-11-23 11:52:04,152 INFO L256 TraceCheckUtils]: 73: Hoare triple {4414#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {4414#false} is VALID [2018-11-23 11:52:04,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {4414#false} ~cond := #in~cond; {4414#false} is VALID [2018-11-23 11:52:04,153 INFO L273 TraceCheckUtils]: 75: Hoare triple {4414#false} assume 0 == ~cond; {4414#false} is VALID [2018-11-23 11:52:04,153 INFO L273 TraceCheckUtils]: 76: Hoare triple {4414#false} assume !false; {4414#false} is VALID [2018-11-23 11:52:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:52:04,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:04,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:52:04,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-11-23 11:52:04,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:04,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:52:04,234 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:04,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:52:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:52:04,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:04,236 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 12 states. [2018-11-23 11:52:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,577 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-23 11:52:04,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:04,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-11-23 11:52:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 11:52:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 11:52:04,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-23 11:52:05,143 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:05,146 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:52:05,146 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:52:05,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 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:52:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:52:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 11:52:05,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:05,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:05,197 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:05,197 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 11:52:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,199 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:52:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:52:05,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:05,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:05,200 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 11:52:05,201 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 11:52:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,203 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-23 11:52:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-11-23 11:52:05,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:05,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:05,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:05,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:52:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-23 11:52:05,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 77 [2018-11-23 11:52:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:05,207 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-23 11:52:05,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-23 11:52:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:05,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:05,208 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:05,208 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:05,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash -729412440, now seen corresponding path program 9 times [2018-11-23 11:52:05,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:05,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:05,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:05,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:05,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {5162#true} call ULTIMATE.init(); {5162#true} is VALID [2018-11-23 11:52:05,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {5162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5162#true} is VALID [2018-11-23 11:52:05,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {5162#true} assume true; {5162#true} is VALID [2018-11-23 11:52:05,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5162#true} {5162#true} #105#return; {5162#true} is VALID [2018-11-23 11:52:05,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {5162#true} call #t~ret14 := main(); {5162#true} is VALID [2018-11-23 11:52:05,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {5162#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5164#(= main_~a~0 0)} is VALID [2018-11-23 11:52:05,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {5164#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5164#(= main_~a~0 0)} is VALID [2018-11-23 11:52:05,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {5164#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5165#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:05,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {5165#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5165#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:05,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {5165#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5166#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:05,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {5166#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5166#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:05,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {5166#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5167#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:05,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {5167#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5167#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:05,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {5167#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5168#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:05,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {5168#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5168#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:05,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {5168#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5169#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:05,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {5169#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5169#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:05,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {5169#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5170#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:05,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {5170#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5170#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:05,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {5170#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5171#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:05,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {5171#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5171#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:05,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {5171#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5172#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:05,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {5172#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5172#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:05,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {5172#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5173#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:05,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {5173#(<= main_~a~0 9)} assume !(~a~0 < 100000); {5163#false} is VALID [2018-11-23 11:52:05,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {5163#false} havoc ~i~0;~i~0 := 0; {5163#false} is VALID [2018-11-23 11:52:05,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5163#false} is VALID [2018-11-23 11:52:05,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {5163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5163#false} is VALID [2018-11-23 11:52:05,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5163#false} is VALID [2018-11-23 11:52:05,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {5163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5163#false} is VALID [2018-11-23 11:52:05,546 INFO L273 TraceCheckUtils]: 30: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5163#false} is VALID [2018-11-23 11:52:05,546 INFO L273 TraceCheckUtils]: 31: Hoare triple {5163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5163#false} is VALID [2018-11-23 11:52:05,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5163#false} is VALID [2018-11-23 11:52:05,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {5163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5163#false} is VALID [2018-11-23 11:52:05,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5163#false} is VALID [2018-11-23 11:52:05,547 INFO L273 TraceCheckUtils]: 35: Hoare triple {5163#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5163#false} is VALID [2018-11-23 11:52:05,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:52:05,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {5163#false} ~i~0 := 0; {5163#false} is VALID [2018-11-23 11:52:05,548 INFO L273 TraceCheckUtils]: 38: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5163#false} is VALID [2018-11-23 11:52:05,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {5163#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5163#false} is VALID [2018-11-23 11:52:05,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5163#false} is VALID [2018-11-23 11:52:05,548 INFO L273 TraceCheckUtils]: 41: Hoare triple {5163#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5163#false} is VALID [2018-11-23 11:52:05,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {5163#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {5163#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 46: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 47: Hoare triple {5163#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 48: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 49: Hoare triple {5163#false} ~i~0 := 0; {5163#false} is VALID [2018-11-23 11:52:05,549 INFO L273 TraceCheckUtils]: 50: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 51: Hoare triple {5163#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 52: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 53: Hoare triple {5163#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 54: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 55: Hoare triple {5163#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 56: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 57: Hoare triple {5163#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5163#false} is VALID [2018-11-23 11:52:05,550 INFO L273 TraceCheckUtils]: 58: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 59: Hoare triple {5163#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 60: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 61: Hoare triple {5163#false} ~i~0 := 0; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 62: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 63: Hoare triple {5163#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 64: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 65: Hoare triple {5163#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5163#false} is VALID [2018-11-23 11:52:05,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 67: Hoare triple {5163#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 68: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 69: Hoare triple {5163#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 70: Hoare triple {5163#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 71: Hoare triple {5163#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 72: Hoare triple {5163#false} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {5163#false} havoc ~x~0;~x~0 := 0; {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {5163#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5163#false} is VALID [2018-11-23 11:52:05,552 INFO L256 TraceCheckUtils]: 75: Hoare triple {5163#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {5163#false} is VALID [2018-11-23 11:52:05,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {5163#false} ~cond := #in~cond; {5163#false} is VALID [2018-11-23 11:52:05,553 INFO L273 TraceCheckUtils]: 77: Hoare triple {5163#false} assume 0 == ~cond; {5163#false} is VALID [2018-11-23 11:52:05,553 INFO L273 TraceCheckUtils]: 78: Hoare triple {5163#false} assume !false; {5163#false} is VALID [2018-11-23 11:52:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:52:05,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:05,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:05,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:06,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:52:06,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:06,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:06,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {5162#true} call ULTIMATE.init(); {5162#true} is VALID [2018-11-23 11:52:06,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {5162#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5162#true} is VALID [2018-11-23 11:52:06,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {5162#true} assume true; {5162#true} is VALID [2018-11-23 11:52:06,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5162#true} {5162#true} #105#return; {5162#true} is VALID [2018-11-23 11:52:06,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {5162#true} call #t~ret14 := main(); {5162#true} is VALID [2018-11-23 11:52:06,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {5162#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5162#true} is VALID [2018-11-23 11:52:06,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {5162#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {5162#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {5162#true} assume !(~a~0 < 100000); {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 25: Hoare triple {5162#true} havoc ~i~0;~i~0 := 0; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5162#true} is VALID [2018-11-23 11:52:06,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {5162#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 28: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {5162#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {5162#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 32: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {5162#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 34: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5162#true} is VALID [2018-11-23 11:52:06,626 INFO L273 TraceCheckUtils]: 35: Hoare triple {5162#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 36: Hoare triple {5162#true} assume !(~i~0 < 100000); {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 37: Hoare triple {5162#true} ~i~0 := 0; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 38: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 39: Hoare triple {5162#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {5162#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 42: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 43: Hoare triple {5162#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5162#true} is VALID [2018-11-23 11:52:06,627 INFO L273 TraceCheckUtils]: 44: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 45: Hoare triple {5162#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 46: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {5162#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {5162#true} assume !(~i~0 < 100000); {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {5162#true} ~i~0 := 0; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 50: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 51: Hoare triple {5162#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5162#true} is VALID [2018-11-23 11:52:06,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {5162#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 54: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {5162#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 57: Hoare triple {5162#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {5162#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {5162#true} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5162#true} is VALID [2018-11-23 11:52:06,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {5162#true} assume !(~i~0 < 100000); {5162#true} is VALID [2018-11-23 11:52:06,630 INFO L273 TraceCheckUtils]: 61: Hoare triple {5162#true} ~i~0 := 0; {5360#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:06,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {5360#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5360#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:06,631 INFO L273 TraceCheckUtils]: 63: Hoare triple {5360#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:06,633 INFO L273 TraceCheckUtils]: 64: Hoare triple {5367#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:06,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {5367#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5374#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,634 INFO L273 TraceCheckUtils]: 66: Hoare triple {5374#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5374#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {5374#(<= main_~i~0 2)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5381#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,635 INFO L273 TraceCheckUtils]: 68: Hoare triple {5381#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5381#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {5381#(<= main_~i~0 3)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5388#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,635 INFO L273 TraceCheckUtils]: 70: Hoare triple {5388#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5388#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {5388#(<= main_~i~0 4)} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5395#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:06,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {5395#(<= main_~i~0 5)} assume !(~i~0 < 100000); {5163#false} is VALID [2018-11-23 11:52:06,637 INFO L273 TraceCheckUtils]: 73: Hoare triple {5163#false} havoc ~x~0;~x~0 := 0; {5163#false} is VALID [2018-11-23 11:52:06,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {5163#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5163#false} is VALID [2018-11-23 11:52:06,637 INFO L256 TraceCheckUtils]: 75: Hoare triple {5163#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {5163#false} is VALID [2018-11-23 11:52:06,637 INFO L273 TraceCheckUtils]: 76: Hoare triple {5163#false} ~cond := #in~cond; {5163#false} is VALID [2018-11-23 11:52:06,638 INFO L273 TraceCheckUtils]: 77: Hoare triple {5163#false} assume 0 == ~cond; {5163#false} is VALID [2018-11-23 11:52:06,638 INFO L273 TraceCheckUtils]: 78: Hoare triple {5163#false} assume !false; {5163#false} is VALID [2018-11-23 11:52:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-11-23 11:52:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:52:06,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-11-23 11:52:06,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:06,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:06,732 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:06,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:06,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:06,734 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 18 states. [2018-11-23 11:52:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:07,905 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-11-23 11:52:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:07,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-11-23 11:52:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2018-11-23 11:52:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2018-11-23 11:52:07,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 136 transitions. [2018-11-23 11:52:08,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:08,467 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:52:08,467 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:52:08,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:52:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-11-23 11:52:09,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:09,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 94 states. [2018-11-23 11:52:09,025 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 94 states. [2018-11-23 11:52:09,025 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 94 states. [2018-11-23 11:52:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,028 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-23 11:52:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-11-23 11:52:09,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:09,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:09,029 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 99 states. [2018-11-23 11:52:09,029 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 99 states. [2018-11-23 11:52:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,031 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-23 11:52:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-11-23 11:52:09,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:09,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:09,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:09,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 11:52:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-11-23 11:52:09,035 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 79 [2018-11-23 11:52:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:09,035 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-11-23 11:52:09,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-11-23 11:52:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 11:52:09,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:09,036 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:09,037 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:09,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1671831870, now seen corresponding path program 10 times [2018-11-23 11:52:09,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:09,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:09,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:09,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2018-11-23 11:52:09,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {5985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5985#true} is VALID [2018-11-23 11:52:09,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2018-11-23 11:52:09,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #105#return; {5985#true} is VALID [2018-11-23 11:52:09,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret14 := main(); {5985#true} is VALID [2018-11-23 11:52:09,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {5985#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5987#(= main_~a~0 0)} is VALID [2018-11-23 11:52:09,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {5987#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5987#(= main_~a~0 0)} is VALID [2018-11-23 11:52:09,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {5987#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5988#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:09,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {5988#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5988#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:09,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {5988#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5989#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:09,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {5989#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5989#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:09,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {5989#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5990#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:09,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {5990#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5990#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:09,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {5990#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5991#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:09,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {5991#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5991#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:09,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {5991#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5992#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:09,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {5992#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5992#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:09,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {5992#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5993#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:09,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {5993#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5993#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:09,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {5993#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5994#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:09,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {5994#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5994#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:09,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {5994#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5995#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:09,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {5995#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5995#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:09,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {5995#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5996#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:09,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {5996#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5996#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:09,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {5996#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5997#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:09,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {5997#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {5986#false} havoc ~i~0;~i~0 := 0; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {5986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 30: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 31: Hoare triple {5986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 32: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {5986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5986#false} is VALID [2018-11-23 11:52:09,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {5986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {5986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {5986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 41: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5986#false} is VALID [2018-11-23 11:52:09,811 INFO L273 TraceCheckUtils]: 43: Hoare triple {5986#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {5986#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {5986#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {5986#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5986#false} is VALID [2018-11-23 11:52:09,812 INFO L273 TraceCheckUtils]: 51: Hoare triple {5986#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 52: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {5986#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 54: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 55: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {5986#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5986#false} is VALID [2018-11-23 11:52:09,813 INFO L273 TraceCheckUtils]: 59: Hoare triple {5986#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 60: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 61: Hoare triple {5986#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 62: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 63: Hoare triple {5986#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 64: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 65: Hoare triple {5986#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 66: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 67: Hoare triple {5986#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5986#false} is VALID [2018-11-23 11:52:09,814 INFO L273 TraceCheckUtils]: 68: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 69: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 70: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 71: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 72: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 73: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 74: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 75: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:09,815 INFO L273 TraceCheckUtils]: 76: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 77: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 78: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 79: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 80: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 81: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 82: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 83: Hoare triple {5986#false} havoc ~x~0;~x~0 := 0; {5986#false} is VALID [2018-11-23 11:52:09,816 INFO L273 TraceCheckUtils]: 84: Hoare triple {5986#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5986#false} is VALID [2018-11-23 11:52:09,817 INFO L256 TraceCheckUtils]: 85: Hoare triple {5986#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {5986#false} is VALID [2018-11-23 11:52:09,817 INFO L273 TraceCheckUtils]: 86: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2018-11-23 11:52:09,817 INFO L273 TraceCheckUtils]: 87: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2018-11-23 11:52:09,817 INFO L273 TraceCheckUtils]: 88: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2018-11-23 11:52:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 11:52:09,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:09,821 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:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:09,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:09,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:09,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:10,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5985#true} is VALID [2018-11-23 11:52:10,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {5985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5985#true} is VALID [2018-11-23 11:52:10,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2018-11-23 11:52:10,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #105#return; {5985#true} is VALID [2018-11-23 11:52:10,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret14 := main(); {5985#true} is VALID [2018-11-23 11:52:10,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {5985#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5985#true} is VALID [2018-11-23 11:52:10,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 24: Hoare triple {5985#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {5985#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5985#true} is VALID [2018-11-23 11:52:10,096 INFO L273 TraceCheckUtils]: 26: Hoare triple {5985#true} assume !(~a~0 < 100000); {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {5985#true} havoc ~i~0;~i~0 := 0; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {5985#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {5985#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {5985#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5985#true} is VALID [2018-11-23 11:52:10,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {5985#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {5985#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {5985#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {5985#true} assume !(~i~0 < 100000); {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 41: Hoare triple {5985#true} ~i~0 := 0; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 42: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5985#true} is VALID [2018-11-23 11:52:10,098 INFO L273 TraceCheckUtils]: 43: Hoare triple {5985#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 44: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {5985#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {5985#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {5985#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5985#true} is VALID [2018-11-23 11:52:10,099 INFO L273 TraceCheckUtils]: 51: Hoare triple {5985#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5985#true} is VALID [2018-11-23 11:52:10,100 INFO L273 TraceCheckUtils]: 52: Hoare triple {5985#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5985#true} is VALID [2018-11-23 11:52:10,100 INFO L273 TraceCheckUtils]: 53: Hoare triple {5985#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5985#true} is VALID [2018-11-23 11:52:10,100 INFO L273 TraceCheckUtils]: 54: Hoare triple {5985#true} assume !(~i~0 < 100000); {5985#true} is VALID [2018-11-23 11:52:10,101 INFO L273 TraceCheckUtils]: 55: Hoare triple {5985#true} ~i~0 := 0; {6166#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:10,101 INFO L273 TraceCheckUtils]: 56: Hoare triple {6166#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6166#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:10,101 INFO L273 TraceCheckUtils]: 57: Hoare triple {6166#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6173#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:10,102 INFO L273 TraceCheckUtils]: 58: Hoare triple {6173#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6173#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:10,102 INFO L273 TraceCheckUtils]: 59: Hoare triple {6173#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6180#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,103 INFO L273 TraceCheckUtils]: 60: Hoare triple {6180#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6180#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,103 INFO L273 TraceCheckUtils]: 61: Hoare triple {6180#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6187#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {6187#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6187#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,104 INFO L273 TraceCheckUtils]: 63: Hoare triple {6187#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6194#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,105 INFO L273 TraceCheckUtils]: 64: Hoare triple {6194#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6194#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,105 INFO L273 TraceCheckUtils]: 65: Hoare triple {6194#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6201#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {6201#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6201#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,107 INFO L273 TraceCheckUtils]: 67: Hoare triple {6201#(<= main_~i~0 5)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6208#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:10,107 INFO L273 TraceCheckUtils]: 68: Hoare triple {6208#(<= main_~i~0 6)} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:10,107 INFO L273 TraceCheckUtils]: 69: Hoare triple {5986#false} ~i~0 := 0; {5986#false} is VALID [2018-11-23 11:52:10,108 INFO L273 TraceCheckUtils]: 70: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:10,108 INFO L273 TraceCheckUtils]: 71: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:10,108 INFO L273 TraceCheckUtils]: 72: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:10,108 INFO L273 TraceCheckUtils]: 73: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:10,108 INFO L273 TraceCheckUtils]: 74: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:10,109 INFO L273 TraceCheckUtils]: 75: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:10,109 INFO L273 TraceCheckUtils]: 76: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:10,109 INFO L273 TraceCheckUtils]: 77: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:10,109 INFO L273 TraceCheckUtils]: 78: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:10,109 INFO L273 TraceCheckUtils]: 79: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:10,110 INFO L273 TraceCheckUtils]: 80: Hoare triple {5986#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {5986#false} is VALID [2018-11-23 11:52:10,110 INFO L273 TraceCheckUtils]: 81: Hoare triple {5986#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {5986#false} is VALID [2018-11-23 11:52:10,110 INFO L273 TraceCheckUtils]: 82: Hoare triple {5986#false} assume !(~i~0 < 100000); {5986#false} is VALID [2018-11-23 11:52:10,110 INFO L273 TraceCheckUtils]: 83: Hoare triple {5986#false} havoc ~x~0;~x~0 := 0; {5986#false} is VALID [2018-11-23 11:52:10,110 INFO L273 TraceCheckUtils]: 84: Hoare triple {5986#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {5986#false} is VALID [2018-11-23 11:52:10,110 INFO L256 TraceCheckUtils]: 85: Hoare triple {5986#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {5986#false} is VALID [2018-11-23 11:52:10,111 INFO L273 TraceCheckUtils]: 86: Hoare triple {5986#false} ~cond := #in~cond; {5986#false} is VALID [2018-11-23 11:52:10,111 INFO L273 TraceCheckUtils]: 87: Hoare triple {5986#false} assume 0 == ~cond; {5986#false} is VALID [2018-11-23 11:52:10,111 INFO L273 TraceCheckUtils]: 88: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2018-11-23 11:52:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-23 11:52:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 11:52:10,134 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-23 11:52:10,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:10,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:10,206 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:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:10,207 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 20 states. [2018-11-23 11:52:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,373 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-11-23 11:52:11,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:11,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-11-23 11:52:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 146 transitions. [2018-11-23 11:52:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 146 transitions. [2018-11-23 11:52:11,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 146 transitions. [2018-11-23 11:52:11,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:11,934 INFO L225 Difference]: With dead ends: 176 [2018-11-23 11:52:11,934 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:52:11,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:52:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2018-11-23 11:52:11,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:11,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 104 states. [2018-11-23 11:52:11,977 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 104 states. [2018-11-23 11:52:11,977 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 104 states. [2018-11-23 11:52:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,982 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-23 11:52:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-11-23 11:52:11,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:11,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:11,983 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 109 states. [2018-11-23 11:52:11,983 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 109 states. [2018-11-23 11:52:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,988 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-23 11:52:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-11-23 11:52:11,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:11,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:11,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:11,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:52:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-11-23 11:52:11,992 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 89 [2018-11-23 11:52:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:11,992 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-11-23 11:52:11,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-11-23 11:52:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:52:11,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:11,994 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:52:11,994 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:11,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -708791724, now seen corresponding path program 11 times [2018-11-23 11:52:11,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:11,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:11,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:11,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:12,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {6902#true} call ULTIMATE.init(); {6902#true} is VALID [2018-11-23 11:52:12,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {6902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6902#true} is VALID [2018-11-23 11:52:12,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {6902#true} assume true; {6902#true} is VALID [2018-11-23 11:52:12,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6902#true} {6902#true} #105#return; {6902#true} is VALID [2018-11-23 11:52:12,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {6902#true} call #t~ret14 := main(); {6902#true} is VALID [2018-11-23 11:52:12,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {6902#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6904#(= main_~a~0 0)} is VALID [2018-11-23 11:52:12,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {6904#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6904#(= main_~a~0 0)} is VALID [2018-11-23 11:52:12,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {6904#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:12,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {6905#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:12,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {6905#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:12,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {6906#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:12,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {6906#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:12,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {6907#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:12,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {6907#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:12,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {6908#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:12,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {6908#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:12,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {6909#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:12,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {6909#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:12,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {6910#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:12,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {6910#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:12,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {6911#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:12,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {6911#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:12,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {6912#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:12,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {6912#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:12,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {6913#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:12,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {6913#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:12,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {6914#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:12,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {6914#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6915#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:12,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {6915#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6903#false} is VALID [2018-11-23 11:52:12,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {6903#false} havoc ~i~0;~i~0 := 0; {6903#false} is VALID [2018-11-23 11:52:12,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 41: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 46: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,651 INFO L273 TraceCheckUtils]: 48: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,652 INFO L273 TraceCheckUtils]: 57: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 59: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 60: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 63: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 64: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,653 INFO L273 TraceCheckUtils]: 65: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 66: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 68: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 70: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 71: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 72: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,654 INFO L273 TraceCheckUtils]: 73: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 75: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 76: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 77: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 78: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 79: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,655 INFO L273 TraceCheckUtils]: 80: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,656 INFO L273 TraceCheckUtils]: 84: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,656 INFO L273 TraceCheckUtils]: 85: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,657 INFO L273 TraceCheckUtils]: 86: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,657 INFO L273 TraceCheckUtils]: 90: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:52:12,657 INFO L273 TraceCheckUtils]: 91: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:52:12,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:52:12,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {6903#false} havoc ~x~0;~x~0 := 0; {6903#false} is VALID [2018-11-23 11:52:12,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {6903#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {6903#false} is VALID [2018-11-23 11:52:12,658 INFO L256 TraceCheckUtils]: 95: Hoare triple {6903#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {6903#false} is VALID [2018-11-23 11:52:12,658 INFO L273 TraceCheckUtils]: 96: Hoare triple {6903#false} ~cond := #in~cond; {6903#false} is VALID [2018-11-23 11:52:12,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {6903#false} assume 0 == ~cond; {6903#false} is VALID [2018-11-23 11:52:12,659 INFO L273 TraceCheckUtils]: 98: Hoare triple {6903#false} assume !false; {6903#false} is VALID [2018-11-23 11:52:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 11:52:12,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:12,665 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:12,679 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:13,135 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:53:13,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:13,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:13,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {6902#true} call ULTIMATE.init(); {6902#true} is VALID [2018-11-23 11:53:13,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {6902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6902#true} is VALID [2018-11-23 11:53:13,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {6902#true} assume true; {6902#true} is VALID [2018-11-23 11:53:13,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6902#true} {6902#true} #105#return; {6902#true} is VALID [2018-11-23 11:53:13,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {6902#true} call #t~ret14 := main(); {6902#true} is VALID [2018-11-23 11:53:13,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {6902#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6934#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:13,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {6934#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6934#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:13,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {6934#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:13,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {6905#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6905#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:13,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {6905#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:13,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {6906#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6906#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:13,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {6906#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:13,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {6907#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6907#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:13,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {6907#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:13,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {6908#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6908#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:13,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {6908#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:13,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {6909#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6909#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:13,378 INFO L273 TraceCheckUtils]: 17: Hoare triple {6909#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:13,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {6910#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6910#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:13,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {6910#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:13,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {6911#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6911#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:13,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {6911#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:13,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {6912#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6912#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:13,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {6912#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:13,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {6913#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6913#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:13,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {6913#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:13,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {6914#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6914#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:13,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {6914#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6915#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:13,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {6915#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6903#false} is VALID [2018-11-23 11:53:13,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {6903#false} havoc ~i~0;~i~0 := 0; {6903#false} is VALID [2018-11-23 11:53:13,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,386 INFO L273 TraceCheckUtils]: 32: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,387 INFO L273 TraceCheckUtils]: 34: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,387 INFO L273 TraceCheckUtils]: 36: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,388 INFO L273 TraceCheckUtils]: 37: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,388 INFO L273 TraceCheckUtils]: 38: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,388 INFO L273 TraceCheckUtils]: 39: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {6903#false} is VALID [2018-11-23 11:53:13,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {6903#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6903#false} is VALID [2018-11-23 11:53:13,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:53:13,389 INFO L273 TraceCheckUtils]: 45: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:53:13,389 INFO L273 TraceCheckUtils]: 46: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,390 INFO L273 TraceCheckUtils]: 47: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,390 INFO L273 TraceCheckUtils]: 48: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,391 INFO L273 TraceCheckUtils]: 52: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,391 INFO L273 TraceCheckUtils]: 53: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,391 INFO L273 TraceCheckUtils]: 54: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,391 INFO L273 TraceCheckUtils]: 55: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 58: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {6903#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 60: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 61: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 62: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 63: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 64: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,392 INFO L273 TraceCheckUtils]: 65: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 66: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 67: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 68: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 69: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {6903#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 76: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 77: Hoare triple {6903#false} ~i~0 := 0; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 79: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 80: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 81: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,394 INFO L273 TraceCheckUtils]: 82: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 83: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 84: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 85: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 86: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 87: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 88: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 89: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,395 INFO L273 TraceCheckUtils]: 90: Hoare triple {6903#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 91: Hoare triple {6903#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 92: Hoare triple {6903#false} assume !(~i~0 < 100000); {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 93: Hoare triple {6903#false} havoc ~x~0;~x~0 := 0; {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 94: Hoare triple {6903#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L256 TraceCheckUtils]: 95: Hoare triple {6903#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 96: Hoare triple {6903#false} ~cond := #in~cond; {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 97: Hoare triple {6903#false} assume 0 == ~cond; {6903#false} is VALID [2018-11-23 11:53:13,396 INFO L273 TraceCheckUtils]: 98: Hoare triple {6903#false} assume !false; {6903#false} is VALID [2018-11-23 11:53:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 11:53:13,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:53:13,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-11-23 11:53:13,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:13,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:53:13,483 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:53:13,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:53:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:53:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:53:13,485 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 15 states. [2018-11-23 11:53:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:13,743 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-11-23 11:53:13,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:53:13,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-11-23 11:53:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:53:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2018-11-23 11:53:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:53:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2018-11-23 11:53:13,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 88 transitions. [2018-11-23 11:53:14,278 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:14,281 INFO L225 Difference]: With dead ends: 182 [2018-11-23 11:53:14,282 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 11:53:14,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:53:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 11:53:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-11-23 11:53:14,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:14,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 106 states. [2018-11-23 11:53:14,387 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 106 states. [2018-11-23 11:53:14,387 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 106 states. [2018-11-23 11:53:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,391 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 11:53:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-23 11:53:14,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:14,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:14,392 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 107 states. [2018-11-23 11:53:14,393 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 107 states. [2018-11-23 11:53:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,395 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 11:53:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-11-23 11:53:14,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:14,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:14,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:14,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:53:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-11-23 11:53:14,399 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 99 [2018-11-23 11:53:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:14,400 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-11-23 11:53:14,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:53:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-23 11:53:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 11:53:14,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:14,402 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:14,402 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:14,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1022264590, now seen corresponding path program 12 times [2018-11-23 11:53:14,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:14,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:14,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:14,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {7854#true} call ULTIMATE.init(); {7854#true} is VALID [2018-11-23 11:53:14,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {7854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7854#true} is VALID [2018-11-23 11:53:14,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {7854#true} assume true; {7854#true} is VALID [2018-11-23 11:53:14,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7854#true} {7854#true} #105#return; {7854#true} is VALID [2018-11-23 11:53:14,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {7854#true} call #t~ret14 := main(); {7854#true} is VALID [2018-11-23 11:53:14,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {7854#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7856#(= main_~a~0 0)} is VALID [2018-11-23 11:53:14,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {7856#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7856#(= main_~a~0 0)} is VALID [2018-11-23 11:53:14,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {7856#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7857#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:14,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {7857#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7857#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:14,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {7857#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7858#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:14,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {7858#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7858#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:14,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {7858#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7859#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:14,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {7859#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7859#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:14,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {7859#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7860#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:14,990 INFO L273 TraceCheckUtils]: 14: Hoare triple {7860#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7860#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:14,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {7860#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7861#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:14,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {7861#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7861#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:14,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {7861#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7862#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:14,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {7862#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7862#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:14,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {7862#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7863#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:14,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {7863#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7863#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:14,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {7863#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7864#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:14,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {7864#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7864#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:14,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {7864#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7865#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:14,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {7865#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7865#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:14,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {7865#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7866#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:14,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {7866#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7866#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:15,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {7866#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7867#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:15,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {7867#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7867#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:15,001 INFO L273 TraceCheckUtils]: 29: Hoare triple {7867#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7868#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:15,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {7868#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:15,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {7855#false} havoc ~i~0;~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:15,003 INFO L273 TraceCheckUtils]: 32: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,003 INFO L273 TraceCheckUtils]: 33: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,003 INFO L273 TraceCheckUtils]: 35: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,004 INFO L273 TraceCheckUtils]: 37: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,004 INFO L273 TraceCheckUtils]: 38: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,005 INFO L273 TraceCheckUtils]: 39: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,005 INFO L273 TraceCheckUtils]: 40: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,005 INFO L273 TraceCheckUtils]: 41: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,005 INFO L273 TraceCheckUtils]: 42: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7855#false} is VALID [2018-11-23 11:53:15,006 INFO L273 TraceCheckUtils]: 45: Hoare triple {7855#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7855#false} is VALID [2018-11-23 11:53:15,006 INFO L273 TraceCheckUtils]: 46: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:15,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 48: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 49: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 50: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 51: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 52: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 53: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,007 INFO L273 TraceCheckUtils]: 54: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,008 INFO L273 TraceCheckUtils]: 56: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,008 INFO L273 TraceCheckUtils]: 57: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,008 INFO L273 TraceCheckUtils]: 59: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,008 INFO L273 TraceCheckUtils]: 60: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:15,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:15,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:15,009 INFO L273 TraceCheckUtils]: 63: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:15,009 INFO L273 TraceCheckUtils]: 64: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,009 INFO L273 TraceCheckUtils]: 65: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,009 INFO L273 TraceCheckUtils]: 66: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 68: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 69: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 70: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 71: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 72: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,011 INFO L273 TraceCheckUtils]: 74: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,011 INFO L273 TraceCheckUtils]: 76: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:15,011 INFO L273 TraceCheckUtils]: 77: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:15,011 INFO L273 TraceCheckUtils]: 78: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 79: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 80: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 81: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 82: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 83: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 84: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,012 INFO L273 TraceCheckUtils]: 85: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,013 INFO L273 TraceCheckUtils]: 86: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,013 INFO L273 TraceCheckUtils]: 87: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,013 INFO L273 TraceCheckUtils]: 88: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,013 INFO L273 TraceCheckUtils]: 89: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,013 INFO L273 TraceCheckUtils]: 90: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,013 INFO L273 TraceCheckUtils]: 91: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,014 INFO L273 TraceCheckUtils]: 92: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:15,014 INFO L273 TraceCheckUtils]: 93: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:15,014 INFO L273 TraceCheckUtils]: 94: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:15,014 INFO L273 TraceCheckUtils]: 95: Hoare triple {7855#false} havoc ~x~0;~x~0 := 0; {7855#false} is VALID [2018-11-23 11:53:15,014 INFO L273 TraceCheckUtils]: 96: Hoare triple {7855#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {7855#false} is VALID [2018-11-23 11:53:15,014 INFO L256 TraceCheckUtils]: 97: Hoare triple {7855#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {7855#false} is VALID [2018-11-23 11:53:15,015 INFO L273 TraceCheckUtils]: 98: Hoare triple {7855#false} ~cond := #in~cond; {7855#false} is VALID [2018-11-23 11:53:15,015 INFO L273 TraceCheckUtils]: 99: Hoare triple {7855#false} assume 0 == ~cond; {7855#false} is VALID [2018-11-23 11:53:15,015 INFO L273 TraceCheckUtils]: 100: Hoare triple {7855#false} assume !false; {7855#false} is VALID [2018-11-23 11:53:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-23 11:53:15,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:15,025 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:53:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:41,527 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:53:41,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:41,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:42,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {7854#true} call ULTIMATE.init(); {7854#true} is VALID [2018-11-23 11:53:42,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {7854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7854#true} is VALID [2018-11-23 11:53:42,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {7854#true} assume true; {7854#true} is VALID [2018-11-23 11:53:42,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7854#true} {7854#true} #105#return; {7854#true} is VALID [2018-11-23 11:53:42,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {7854#true} call #t~ret14 := main(); {7854#true} is VALID [2018-11-23 11:53:42,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {7854#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {7854#true} is VALID [2018-11-23 11:53:42,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,026 INFO L273 TraceCheckUtils]: 28: Hoare triple {7854#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7854#true} is VALID [2018-11-23 11:53:42,026 INFO L273 TraceCheckUtils]: 29: Hoare triple {7854#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7854#true} is VALID [2018-11-23 11:53:42,027 INFO L273 TraceCheckUtils]: 30: Hoare triple {7854#true} assume !(~a~0 < 100000); {7854#true} is VALID [2018-11-23 11:53:42,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {7854#true} havoc ~i~0;~i~0 := 0; {7965#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:42,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {7965#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7965#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:42,065 INFO L273 TraceCheckUtils]: 33: Hoare triple {7965#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7972#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:42,073 INFO L273 TraceCheckUtils]: 34: Hoare triple {7972#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7972#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:42,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {7972#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7979#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {7979#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7979#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {7979#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7986#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {7986#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7986#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {7986#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {7993#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {7993#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,082 INFO L273 TraceCheckUtils]: 41: Hoare triple {7993#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8000#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {8000#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8000#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {8000#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8007#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {8007#(<= 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, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8007#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {8007#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8014#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:42,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {8014#(<= main_~i~0 7)} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:42,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:42,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 55: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 56: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 57: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,088 INFO L273 TraceCheckUtils]: 59: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7855#false} is VALID [2018-11-23 11:53:42,088 INFO L273 TraceCheckUtils]: 61: Hoare triple {7855#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7855#false} is VALID [2018-11-23 11:53:42,088 INFO L273 TraceCheckUtils]: 62: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:42,088 INFO L273 TraceCheckUtils]: 63: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:42,088 INFO L273 TraceCheckUtils]: 64: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 65: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 66: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 67: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 68: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 69: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 70: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 71: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 72: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 74: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 75: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 76: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 77: Hoare triple {7855#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 78: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 79: Hoare triple {7855#false} ~i~0 := 0; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 80: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,090 INFO L273 TraceCheckUtils]: 81: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 82: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 83: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 84: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 85: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 86: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 87: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 88: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 89: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,091 INFO L273 TraceCheckUtils]: 90: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 91: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 92: Hoare triple {7855#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 93: Hoare triple {7855#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 94: Hoare triple {7855#false} assume !(~i~0 < 100000); {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 95: Hoare triple {7855#false} havoc ~x~0;~x~0 := 0; {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 96: Hoare triple {7855#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L256 TraceCheckUtils]: 97: Hoare triple {7855#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {7855#false} is VALID [2018-11-23 11:53:42,092 INFO L273 TraceCheckUtils]: 98: Hoare triple {7855#false} ~cond := #in~cond; {7855#false} is VALID [2018-11-23 11:53:42,093 INFO L273 TraceCheckUtils]: 99: Hoare triple {7855#false} assume 0 == ~cond; {7855#false} is VALID [2018-11-23 11:53:42,093 INFO L273 TraceCheckUtils]: 100: Hoare triple {7855#false} assume !false; {7855#false} is VALID [2018-11-23 11:53:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-11-23 11:53:42,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:42,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 11:53:42,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-11-23 11:53:42,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:42,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:53:42,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:42,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:53:42,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:53:42,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:53:42,194 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 23 states. [2018-11-23 11:53:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:43,119 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-11-23 11:53:43,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:53:43,119 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 101 [2018-11-23 11:53:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:53:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-23 11:53:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:53:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-23 11:53:43,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 158 transitions. [2018-11-23 11:53:43,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:43,283 INFO L225 Difference]: With dead ends: 196 [2018-11-23 11:53:43,283 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:53:43,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:53:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:53:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-11-23 11:53:43,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:43,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 116 states. [2018-11-23 11:53:43,331 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 116 states. [2018-11-23 11:53:43,331 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 116 states. [2018-11-23 11:53:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:43,334 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 11:53:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 11:53:43,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:43,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:43,335 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 121 states. [2018-11-23 11:53:43,335 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 121 states. [2018-11-23 11:53:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:43,337 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 11:53:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 11:53:43,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:43,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:43,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:43,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 11:53:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-11-23 11:53:43,340 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 101 [2018-11-23 11:53:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:43,341 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-11-23 11:53:43,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:53:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-11-23 11:53:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 11:53:43,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:43,342 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:43,342 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:43,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash -198624504, now seen corresponding path program 13 times [2018-11-23 11:53:43,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:43,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:43,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:43,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:44,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {8882#true} call ULTIMATE.init(); {8882#true} is VALID [2018-11-23 11:53:44,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {8882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8882#true} is VALID [2018-11-23 11:53:44,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {8882#true} assume true; {8882#true} is VALID [2018-11-23 11:53:44,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8882#true} {8882#true} #105#return; {8882#true} is VALID [2018-11-23 11:53:44,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {8882#true} call #t~ret14 := main(); {8882#true} is VALID [2018-11-23 11:53:44,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {8882#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8884#(= main_~a~0 0)} is VALID [2018-11-23 11:53:44,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {8884#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8884#(= main_~a~0 0)} is VALID [2018-11-23 11:53:44,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {8884#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:44,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {8885#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:44,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {8885#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:44,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {8886#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:44,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {8886#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:44,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {8887#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:44,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {8887#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:44,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {8888#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:44,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {8888#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:44,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {8889#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:44,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {8889#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:44,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {8890#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:44,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {8890#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:44,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {8891#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:44,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {8891#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:44,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {8892#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:44,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {8892#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:44,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {8893#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:44,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {8893#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:44,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {8894#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:44,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {8894#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:44,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {8895#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:44,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {8895#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:44,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {8896#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:44,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {8896#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:44,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {8897#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:44,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {8883#false} havoc ~i~0;~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:44,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,717 INFO L273 TraceCheckUtils]: 46: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:44,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:44,718 INFO L273 TraceCheckUtils]: 50: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:44,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:44,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,719 INFO L273 TraceCheckUtils]: 57: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,720 INFO L273 TraceCheckUtils]: 63: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,720 INFO L273 TraceCheckUtils]: 64: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,720 INFO L273 TraceCheckUtils]: 65: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,720 INFO L273 TraceCheckUtils]: 66: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:44,720 INFO L273 TraceCheckUtils]: 67: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:44,721 INFO L273 TraceCheckUtils]: 68: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:44,721 INFO L273 TraceCheckUtils]: 69: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:44,721 INFO L273 TraceCheckUtils]: 70: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,721 INFO L273 TraceCheckUtils]: 71: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,721 INFO L273 TraceCheckUtils]: 72: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,721 INFO L273 TraceCheckUtils]: 73: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,722 INFO L273 TraceCheckUtils]: 74: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,722 INFO L273 TraceCheckUtils]: 75: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,722 INFO L273 TraceCheckUtils]: 76: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,722 INFO L273 TraceCheckUtils]: 77: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,722 INFO L273 TraceCheckUtils]: 78: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,722 INFO L273 TraceCheckUtils]: 79: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 80: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 81: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 82: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 83: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 84: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:44,723 INFO L273 TraceCheckUtils]: 86: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:44,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:44,724 INFO L273 TraceCheckUtils]: 88: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,724 INFO L273 TraceCheckUtils]: 89: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,724 INFO L273 TraceCheckUtils]: 90: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,724 INFO L273 TraceCheckUtils]: 91: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,724 INFO L273 TraceCheckUtils]: 92: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,725 INFO L273 TraceCheckUtils]: 93: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,725 INFO L273 TraceCheckUtils]: 94: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,725 INFO L273 TraceCheckUtils]: 95: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,725 INFO L273 TraceCheckUtils]: 96: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,725 INFO L273 TraceCheckUtils]: 97: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 99: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 100: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 101: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 102: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 103: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 104: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 105: Hoare triple {8883#false} havoc ~x~0;~x~0 := 0; {8883#false} is VALID [2018-11-23 11:53:44,726 INFO L273 TraceCheckUtils]: 106: Hoare triple {8883#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {8883#false} is VALID [2018-11-23 11:53:44,727 INFO L256 TraceCheckUtils]: 107: Hoare triple {8883#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {8883#false} is VALID [2018-11-23 11:53:44,727 INFO L273 TraceCheckUtils]: 108: Hoare triple {8883#false} ~cond := #in~cond; {8883#false} is VALID [2018-11-23 11:53:44,727 INFO L273 TraceCheckUtils]: 109: Hoare triple {8883#false} assume 0 == ~cond; {8883#false} is VALID [2018-11-23 11:53:44,727 INFO L273 TraceCheckUtils]: 110: Hoare triple {8883#false} assume !false; {8883#false} is VALID [2018-11-23 11:53:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 11:53:44,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:44,733 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:53:44,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:44,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:45,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {8882#true} call ULTIMATE.init(); {8882#true} is VALID [2018-11-23 11:53:45,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {8882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8882#true} is VALID [2018-11-23 11:53:45,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {8882#true} assume true; {8882#true} is VALID [2018-11-23 11:53:45,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8882#true} {8882#true} #105#return; {8882#true} is VALID [2018-11-23 11:53:45,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {8882#true} call #t~ret14 := main(); {8882#true} is VALID [2018-11-23 11:53:45,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {8882#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8916#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:45,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {8916#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8916#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:45,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {8916#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:45,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {8885#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8885#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:45,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {8885#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:45,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {8886#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8886#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:45,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {8886#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:45,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {8887#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8887#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:45,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {8887#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:45,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {8888#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8888#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:45,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {8888#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:45,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {8889#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8889#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:45,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {8889#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:45,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {8890#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8890#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:45,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {8890#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:45,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {8891#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8891#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:45,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {8891#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:45,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {8892#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8892#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:45,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {8892#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:45,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {8893#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8893#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:45,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {8893#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:45,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {8894#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8894#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:45,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {8894#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:45,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {8895#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8895#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:45,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {8895#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:45,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {8896#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8896#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:45,029 INFO L273 TraceCheckUtils]: 31: Hoare triple {8896#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:45,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {8897#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:45,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {8883#false} havoc ~i~0;~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:45,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,030 INFO L273 TraceCheckUtils]: 35: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,031 INFO L273 TraceCheckUtils]: 40: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,032 INFO L273 TraceCheckUtils]: 45: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {8883#false} is VALID [2018-11-23 11:53:45,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {8883#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8883#false} is VALID [2018-11-23 11:53:45,033 INFO L273 TraceCheckUtils]: 50: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:45,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:45,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,034 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,034 INFO L273 TraceCheckUtils]: 54: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,034 INFO L273 TraceCheckUtils]: 55: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,034 INFO L273 TraceCheckUtils]: 56: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 57: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 60: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 62: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 63: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,035 INFO L273 TraceCheckUtils]: 64: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 65: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 67: Hoare triple {8883#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 69: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 71: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 72: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,036 INFO L273 TraceCheckUtils]: 73: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 74: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 75: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 76: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 77: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 78: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 79: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 80: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,037 INFO L273 TraceCheckUtils]: 81: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 82: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 83: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 84: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 85: Hoare triple {8883#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 86: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 87: Hoare triple {8883#false} ~i~0 := 0; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 88: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 89: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,038 INFO L273 TraceCheckUtils]: 90: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 91: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 92: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 93: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 94: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 97: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 98: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,039 INFO L273 TraceCheckUtils]: 99: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 100: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 101: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {8883#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 103: Hoare triple {8883#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 104: Hoare triple {8883#false} assume !(~i~0 < 100000); {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 105: Hoare triple {8883#false} havoc ~x~0;~x~0 := 0; {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L273 TraceCheckUtils]: 106: Hoare triple {8883#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {8883#false} is VALID [2018-11-23 11:53:45,040 INFO L256 TraceCheckUtils]: 107: Hoare triple {8883#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {8883#false} is VALID [2018-11-23 11:53:45,041 INFO L273 TraceCheckUtils]: 108: Hoare triple {8883#false} ~cond := #in~cond; {8883#false} is VALID [2018-11-23 11:53:45,041 INFO L273 TraceCheckUtils]: 109: Hoare triple {8883#false} assume 0 == ~cond; {8883#false} is VALID [2018-11-23 11:53:45,041 INFO L273 TraceCheckUtils]: 110: Hoare triple {8883#false} assume !false; {8883#false} is VALID [2018-11-23 11:53:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 11:53:45,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:45,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:53:45,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 111 [2018-11-23 11:53:45,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:45,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:53:45,126 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:53:45,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:53:45,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:53:45,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:53:45,127 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 17 states. [2018-11-23 11:53:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,404 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2018-11-23 11:53:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:53:45,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 111 [2018-11-23 11:53:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:53:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-11-23 11:53:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:53:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 92 transitions. [2018-11-23 11:53:45,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 92 transitions. [2018-11-23 11:53:45,543 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:53:45,544 INFO L225 Difference]: With dead ends: 202 [2018-11-23 11:53:45,545 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 11:53:45,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:53:45,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 11:53:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-11-23 11:53:45,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:45,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 118 states. [2018-11-23 11:53:45,669 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 118 states. [2018-11-23 11:53:45,669 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 118 states. [2018-11-23 11:53:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,671 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-23 11:53:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-11-23 11:53:45,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:45,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:45,672 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 119 states. [2018-11-23 11:53:45,672 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 119 states. [2018-11-23 11:53:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,675 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-23 11:53:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-11-23 11:53:45,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:45,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:45,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:45,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:53:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-11-23 11:53:45,678 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 111 [2018-11-23 11:53:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:45,679 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-11-23 11:53:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:53:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-11-23 11:53:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 11:53:45,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:45,680 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:45,680 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:45,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash -76806490, now seen corresponding path program 14 times [2018-11-23 11:53:45,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:45,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:45,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:45,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:45,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:46,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {9944#true} call ULTIMATE.init(); {9944#true} is VALID [2018-11-23 11:53:46,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {9944#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9944#true} is VALID [2018-11-23 11:53:46,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {9944#true} assume true; {9944#true} is VALID [2018-11-23 11:53:46,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9944#true} {9944#true} #105#return; {9944#true} is VALID [2018-11-23 11:53:46,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {9944#true} call #t~ret14 := main(); {9944#true} is VALID [2018-11-23 11:53:46,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {9944#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9946#(= main_~a~0 0)} is VALID [2018-11-23 11:53:46,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {9946#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9946#(= main_~a~0 0)} is VALID [2018-11-23 11:53:46,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {9946#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:46,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {9947#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:46,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {9947#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:46,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:46,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {9948#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:46,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {9949#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:46,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {9949#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:46,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {9950#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:46,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:46,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {9951#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:46,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {9951#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:46,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {9952#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:46,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {9952#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:46,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {9953#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:46,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {9953#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:46,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {9954#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:46,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {9954#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:46,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {9955#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:46,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {9955#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:46,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {9956#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:46,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {9956#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:46,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {9957#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:46,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {9957#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:46,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {9958#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:46,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {9958#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:46,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {9959#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:46,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {9959#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9960#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:46,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {9960#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {9945#false} havoc ~i~0;~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,126 INFO L273 TraceCheckUtils]: 42: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,126 INFO L273 TraceCheckUtils]: 43: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,127 INFO L273 TraceCheckUtils]: 46: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,127 INFO L273 TraceCheckUtils]: 47: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,127 INFO L273 TraceCheckUtils]: 48: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,127 INFO L273 TraceCheckUtils]: 49: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,128 INFO L273 TraceCheckUtils]: 54: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,128 INFO L273 TraceCheckUtils]: 55: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,129 INFO L273 TraceCheckUtils]: 56: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,129 INFO L273 TraceCheckUtils]: 57: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,129 INFO L273 TraceCheckUtils]: 58: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 61: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 63: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 64: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,130 INFO L273 TraceCheckUtils]: 67: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 68: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 69: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 70: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 71: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 72: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 74: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 77: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 78: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 79: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 80: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 85: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 86: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 87: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 88: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 91: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 92: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,133 INFO L273 TraceCheckUtils]: 93: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 94: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 95: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 96: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 97: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 98: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 99: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 100: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 101: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 102: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,134 INFO L273 TraceCheckUtils]: 103: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 104: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 105: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 106: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 107: Hoare triple {9945#false} havoc ~x~0;~x~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 108: Hoare triple {9945#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L256 TraceCheckUtils]: 109: Hoare triple {9945#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 110: Hoare triple {9945#false} ~cond := #in~cond; {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 111: Hoare triple {9945#false} assume 0 == ~cond; {9945#false} is VALID [2018-11-23 11:53:46,135 INFO L273 TraceCheckUtils]: 112: Hoare triple {9945#false} assume !false; {9945#false} is VALID [2018-11-23 11:53:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 11:53:46,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:46,141 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:53:46,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:46,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:46,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:46,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:46,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {9944#true} call ULTIMATE.init(); {9944#true} is VALID [2018-11-23 11:53:46,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {9944#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9944#true} is VALID [2018-11-23 11:53:46,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {9944#true} assume true; {9944#true} is VALID [2018-11-23 11:53:46,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9944#true} {9944#true} #105#return; {9944#true} is VALID [2018-11-23 11:53:46,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {9944#true} call #t~ret14 := main(); {9944#true} is VALID [2018-11-23 11:53:46,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {9944#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {9979#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:46,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {9979#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9979#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:46,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {9979#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:46,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {9947#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9947#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:46,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {9947#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:46,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {9948#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9948#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:46,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {9948#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:46,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {9949#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9949#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:46,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {9949#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:46,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {9950#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9950#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:46,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {9950#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:46,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {9951#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9951#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:46,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {9951#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:46,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {9952#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9952#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:46,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {9952#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:46,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {9953#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9953#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:46,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {9953#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:46,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {9954#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9954#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:46,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {9954#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:46,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {9955#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9955#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:46,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {9955#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:46,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {9956#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9956#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:46,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {9956#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:46,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {9957#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9957#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:46,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {9957#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:46,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {9958#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9958#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:46,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {9958#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:46,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {9959#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9959#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:46,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {9959#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9960#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:46,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {9960#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {9945#false} havoc ~i~0;~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,439 INFO L273 TraceCheckUtils]: 37: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,439 INFO L273 TraceCheckUtils]: 38: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,440 INFO L273 TraceCheckUtils]: 43: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,440 INFO L273 TraceCheckUtils]: 44: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,441 INFO L273 TraceCheckUtils]: 46: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,441 INFO L273 TraceCheckUtils]: 47: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,441 INFO L273 TraceCheckUtils]: 48: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,442 INFO L273 TraceCheckUtils]: 49: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,442 INFO L273 TraceCheckUtils]: 50: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {9945#false} is VALID [2018-11-23 11:53:46,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {9945#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9945#false} is VALID [2018-11-23 11:53:46,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,442 INFO L273 TraceCheckUtils]: 53: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 55: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 56: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 57: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 58: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,443 INFO L273 TraceCheckUtils]: 62: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 63: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 64: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 65: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 66: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {9945#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,445 INFO L273 TraceCheckUtils]: 72: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,445 INFO L273 TraceCheckUtils]: 73: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,445 INFO L273 TraceCheckUtils]: 74: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,446 INFO L273 TraceCheckUtils]: 79: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,446 INFO L273 TraceCheckUtils]: 80: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,447 INFO L273 TraceCheckUtils]: 83: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,447 INFO L273 TraceCheckUtils]: 84: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,447 INFO L273 TraceCheckUtils]: 85: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,447 INFO L273 TraceCheckUtils]: 86: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9945#false} is VALID [2018-11-23 11:53:46,447 INFO L273 TraceCheckUtils]: 87: Hoare triple {9945#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9945#false} is VALID [2018-11-23 11:53:46,447 INFO L273 TraceCheckUtils]: 88: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,448 INFO L273 TraceCheckUtils]: 89: Hoare triple {9945#false} ~i~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,448 INFO L273 TraceCheckUtils]: 90: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,448 INFO L273 TraceCheckUtils]: 91: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,448 INFO L273 TraceCheckUtils]: 94: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,449 INFO L273 TraceCheckUtils]: 95: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,449 INFO L273 TraceCheckUtils]: 96: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,449 INFO L273 TraceCheckUtils]: 97: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,449 INFO L273 TraceCheckUtils]: 98: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,449 INFO L273 TraceCheckUtils]: 99: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,449 INFO L273 TraceCheckUtils]: 100: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,450 INFO L273 TraceCheckUtils]: 101: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,450 INFO L273 TraceCheckUtils]: 102: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,450 INFO L273 TraceCheckUtils]: 103: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {9945#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {9945#false} is VALID [2018-11-23 11:53:46,450 INFO L273 TraceCheckUtils]: 105: Hoare triple {9945#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {9945#false} is VALID [2018-11-23 11:53:46,450 INFO L273 TraceCheckUtils]: 106: Hoare triple {9945#false} assume !(~i~0 < 100000); {9945#false} is VALID [2018-11-23 11:53:46,451 INFO L273 TraceCheckUtils]: 107: Hoare triple {9945#false} havoc ~x~0;~x~0 := 0; {9945#false} is VALID [2018-11-23 11:53:46,451 INFO L273 TraceCheckUtils]: 108: Hoare triple {9945#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {9945#false} is VALID [2018-11-23 11:53:46,451 INFO L256 TraceCheckUtils]: 109: Hoare triple {9945#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {9945#false} is VALID [2018-11-23 11:53:46,451 INFO L273 TraceCheckUtils]: 110: Hoare triple {9945#false} ~cond := #in~cond; {9945#false} is VALID [2018-11-23 11:53:46,451 INFO L273 TraceCheckUtils]: 111: Hoare triple {9945#false} assume 0 == ~cond; {9945#false} is VALID [2018-11-23 11:53:46,451 INFO L273 TraceCheckUtils]: 112: Hoare triple {9945#false} assume !false; {9945#false} is VALID [2018-11-23 11:53:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 11:53:46,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:46,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:53:46,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2018-11-23 11:53:46,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:46,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:53:46,552 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:53:46,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:53:46,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:53:46,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:53:46,554 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 18 states. [2018-11-23 11:53:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,297 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-11-23 11:53:47,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:53:47,297 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2018-11-23 11:53:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:53:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 11:53:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:53:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2018-11-23 11:53:47,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2018-11-23 11:53:47,403 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:53:47,405 INFO L225 Difference]: With dead ends: 204 [2018-11-23 11:53:47,405 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:53:47,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:53:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:53:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-23 11:53:47,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:47,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 120 states. [2018-11-23 11:53:47,458 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 120 states. [2018-11-23 11:53:47,458 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 120 states. [2018-11-23 11:53:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,460 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 11:53:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 11:53:47,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:47,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:47,461 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 121 states. [2018-11-23 11:53:47,461 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 121 states. [2018-11-23 11:53:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:47,463 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-11-23 11:53:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-23 11:53:47,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:47,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:47,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:47,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 11:53:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-11-23 11:53:47,467 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 113 [2018-11-23 11:53:47,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:47,467 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-11-23 11:53:47,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:53:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-11-23 11:53:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:53:47,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:47,468 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:53:47,469 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:47,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:47,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1026187972, now seen corresponding path program 15 times [2018-11-23 11:53:47,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:47,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:47,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:47,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:47,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:47,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {11023#true} call ULTIMATE.init(); {11023#true} is VALID [2018-11-23 11:53:47,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {11023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11023#true} is VALID [2018-11-23 11:53:47,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {11023#true} assume true; {11023#true} is VALID [2018-11-23 11:53:47,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11023#true} {11023#true} #105#return; {11023#true} is VALID [2018-11-23 11:53:47,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {11023#true} call #t~ret14 := main(); {11023#true} is VALID [2018-11-23 11:53:47,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {11023#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11025#(= main_~a~0 0)} is VALID [2018-11-23 11:53:47,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {11025#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11025#(= main_~a~0 0)} is VALID [2018-11-23 11:53:47,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {11025#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11026#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:47,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {11026#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11026#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:47,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {11026#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11027#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:47,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {11027#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11027#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:47,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {11027#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11028#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:47,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {11028#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11028#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:47,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {11028#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11029#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:47,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {11029#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11029#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:47,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {11029#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11030#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:47,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {11030#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11030#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:47,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {11030#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11031#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:47,792 INFO L273 TraceCheckUtils]: 18: Hoare triple {11031#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11031#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:47,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {11031#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11032#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:47,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {11032#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11032#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:47,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {11032#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11033#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:47,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {11033#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11033#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:47,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {11033#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11034#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:47,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {11034#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11034#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:47,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {11034#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11035#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:47,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {11035#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11035#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:47,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {11035#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11036#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:47,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {11036#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11036#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:47,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {11036#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11037#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:47,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {11037#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11037#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:47,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {11037#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11038#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:47,801 INFO L273 TraceCheckUtils]: 32: Hoare triple {11038#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11038#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:47,802 INFO L273 TraceCheckUtils]: 33: Hoare triple {11038#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11039#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:47,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {11039#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11039#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:47,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {11039#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11040#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:47,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {11040#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:47,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {11024#false} havoc ~i~0;~i~0 := 0; {11024#false} is VALID [2018-11-23 11:53:47,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,807 INFO L273 TraceCheckUtils]: 50: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,807 INFO L273 TraceCheckUtils]: 51: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,807 INFO L273 TraceCheckUtils]: 52: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11024#false} is VALID [2018-11-23 11:53:47,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {11024#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11024#false} is VALID [2018-11-23 11:53:47,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:47,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 11:53:47,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,808 INFO L273 TraceCheckUtils]: 57: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,808 INFO L273 TraceCheckUtils]: 58: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 61: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 62: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 63: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 64: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 66: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,809 INFO L273 TraceCheckUtils]: 68: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 69: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 70: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 71: Hoare triple {11024#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 72: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 74: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 75: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 76: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,810 INFO L273 TraceCheckUtils]: 77: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 78: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 79: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 80: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 81: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 83: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,811 INFO L273 TraceCheckUtils]: 85: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 87: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 88: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {11024#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 90: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 91: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 92: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 93: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,812 INFO L273 TraceCheckUtils]: 94: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 95: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 96: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 97: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 98: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 99: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 100: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 101: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 102: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,813 INFO L273 TraceCheckUtils]: 103: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 104: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 105: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 106: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 107: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 108: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 109: Hoare triple {11024#false} havoc ~x~0;~x~0 := 0; {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L273 TraceCheckUtils]: 110: Hoare triple {11024#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {11024#false} is VALID [2018-11-23 11:53:47,814 INFO L256 TraceCheckUtils]: 111: Hoare triple {11024#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {11024#false} is VALID [2018-11-23 11:53:47,815 INFO L273 TraceCheckUtils]: 112: Hoare triple {11024#false} ~cond := #in~cond; {11024#false} is VALID [2018-11-23 11:53:47,815 INFO L273 TraceCheckUtils]: 113: Hoare triple {11024#false} assume 0 == ~cond; {11024#false} is VALID [2018-11-23 11:53:47,815 INFO L273 TraceCheckUtils]: 114: Hoare triple {11024#false} assume !false; {11024#false} is VALID [2018-11-23 11:53:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-11-23 11:53:47,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:47,821 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:53:47,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:57,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:53:57,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:57,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:58,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {11023#true} call ULTIMATE.init(); {11023#true} is VALID [2018-11-23 11:53:58,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {11023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11023#true} is VALID [2018-11-23 11:53:58,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {11023#true} assume true; {11023#true} is VALID [2018-11-23 11:53:58,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11023#true} {11023#true} #105#return; {11023#true} is VALID [2018-11-23 11:53:58,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {11023#true} call #t~ret14 := main(); {11023#true} is VALID [2018-11-23 11:53:58,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {11023#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11023#true} is VALID [2018-11-23 11:53:58,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 21: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 22: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 32: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11023#true} is VALID [2018-11-23 11:53:58,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {11023#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11023#true} is VALID [2018-11-23 11:53:58,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {11023#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11146#(< main_~a~0 100000)} is VALID [2018-11-23 11:53:58,045 INFO L273 TraceCheckUtils]: 35: Hoare triple {11146#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11150#(<= main_~a~0 100000)} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 36: Hoare triple {11150#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 37: Hoare triple {11023#true} havoc ~i~0;~i~0 := 0; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 39: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 40: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 46: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 50: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {11023#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {11023#true} assume !(~i~0 < 100000); {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {11023#true} ~i~0 := 0; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 56: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 58: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 59: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,048 INFO L273 TraceCheckUtils]: 61: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 64: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 65: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 67: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 68: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {11023#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11023#true} is VALID [2018-11-23 11:53:58,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {11023#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11023#true} is VALID [2018-11-23 11:53:58,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {11023#true} assume !(~i~0 < 100000); {11023#true} is VALID [2018-11-23 11:53:58,050 INFO L273 TraceCheckUtils]: 73: Hoare triple {11023#true} ~i~0 := 0; {11265#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:58,051 INFO L273 TraceCheckUtils]: 74: Hoare triple {11265#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11265#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:58,051 INFO L273 TraceCheckUtils]: 75: Hoare triple {11265#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11272#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:58,051 INFO L273 TraceCheckUtils]: 76: Hoare triple {11272#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11272#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:58,052 INFO L273 TraceCheckUtils]: 77: Hoare triple {11272#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11279#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:58,052 INFO L273 TraceCheckUtils]: 78: Hoare triple {11279#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11279#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:58,053 INFO L273 TraceCheckUtils]: 79: Hoare triple {11279#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11286#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:58,053 INFO L273 TraceCheckUtils]: 80: Hoare triple {11286#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11286#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:58,053 INFO L273 TraceCheckUtils]: 81: Hoare triple {11286#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11293#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:58,054 INFO L273 TraceCheckUtils]: 82: Hoare triple {11293#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11293#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:58,055 INFO L273 TraceCheckUtils]: 83: Hoare triple {11293#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11300#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:58,055 INFO L273 TraceCheckUtils]: 84: Hoare triple {11300#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11300#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:58,056 INFO L273 TraceCheckUtils]: 85: Hoare triple {11300#(<= main_~i~0 5)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11307#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:58,056 INFO L273 TraceCheckUtils]: 86: Hoare triple {11307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11307#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:58,057 INFO L273 TraceCheckUtils]: 87: Hoare triple {11307#(<= main_~i~0 6)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11314#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:58,058 INFO L273 TraceCheckUtils]: 88: Hoare triple {11314#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11314#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:58,058 INFO L273 TraceCheckUtils]: 89: Hoare triple {11314#(<= main_~i~0 7)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11321#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:58,059 INFO L273 TraceCheckUtils]: 90: Hoare triple {11321#(<= main_~i~0 8)} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:58,059 INFO L273 TraceCheckUtils]: 91: Hoare triple {11024#false} ~i~0 := 0; {11024#false} is VALID [2018-11-23 11:53:58,060 INFO L273 TraceCheckUtils]: 92: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,060 INFO L273 TraceCheckUtils]: 93: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,060 INFO L273 TraceCheckUtils]: 94: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,060 INFO L273 TraceCheckUtils]: 95: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,060 INFO L273 TraceCheckUtils]: 96: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,061 INFO L273 TraceCheckUtils]: 97: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,061 INFO L273 TraceCheckUtils]: 98: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,061 INFO L273 TraceCheckUtils]: 99: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,061 INFO L273 TraceCheckUtils]: 100: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,061 INFO L273 TraceCheckUtils]: 101: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,062 INFO L273 TraceCheckUtils]: 102: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,062 INFO L273 TraceCheckUtils]: 103: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,062 INFO L273 TraceCheckUtils]: 104: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,062 INFO L273 TraceCheckUtils]: 105: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,062 INFO L273 TraceCheckUtils]: 106: Hoare triple {11024#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {11024#false} is VALID [2018-11-23 11:53:58,063 INFO L273 TraceCheckUtils]: 107: Hoare triple {11024#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {11024#false} is VALID [2018-11-23 11:53:58,063 INFO L273 TraceCheckUtils]: 108: Hoare triple {11024#false} assume !(~i~0 < 100000); {11024#false} is VALID [2018-11-23 11:53:58,063 INFO L273 TraceCheckUtils]: 109: Hoare triple {11024#false} havoc ~x~0;~x~0 := 0; {11024#false} is VALID [2018-11-23 11:53:58,064 INFO L273 TraceCheckUtils]: 110: Hoare triple {11024#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {11024#false} is VALID [2018-11-23 11:53:58,064 INFO L256 TraceCheckUtils]: 111: Hoare triple {11024#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {11024#false} is VALID [2018-11-23 11:53:58,064 INFO L273 TraceCheckUtils]: 112: Hoare triple {11024#false} ~cond := #in~cond; {11024#false} is VALID [2018-11-23 11:53:58,064 INFO L273 TraceCheckUtils]: 113: Hoare triple {11024#false} assume 0 == ~cond; {11024#false} is VALID [2018-11-23 11:53:58,064 INFO L273 TraceCheckUtils]: 114: Hoare triple {11024#false} assume !false; {11024#false} is VALID [2018-11-23 11:53:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 29 proven. 64 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-23 11:53:58,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:58,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-11-23 11:53:58,096 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-23 11:53:58,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:58,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:53:58,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:58,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:53:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:53:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:53:58,191 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 29 states. [2018-11-23 11:53:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:59,408 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-11-23 11:53:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:53:59,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-23 11:53:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:53:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 174 transitions. [2018-11-23 11:53:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:53:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 174 transitions. [2018-11-23 11:53:59,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 174 transitions. [2018-11-23 11:54:00,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:00,222 INFO L225 Difference]: With dead ends: 219 [2018-11-23 11:54:00,223 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 11:54:00,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:54:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 11:54:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-11-23 11:54:00,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:00,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 132 states. [2018-11-23 11:54:00,328 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 132 states. [2018-11-23 11:54:00,328 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 132 states. [2018-11-23 11:54:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:00,343 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-11-23 11:54:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-11-23 11:54:00,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:00,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:00,344 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 136 states. [2018-11-23 11:54:00,344 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 136 states. [2018-11-23 11:54:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:00,348 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-11-23 11:54:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-11-23 11:54:00,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:00,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:00,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:00,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 11:54:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2018-11-23 11:54:00,354 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 115 [2018-11-23 11:54:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:00,354 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2018-11-23 11:54:00,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:54:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-11-23 11:54:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 11:54:00,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:00,355 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:00,356 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:00,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash -634789000, now seen corresponding path program 16 times [2018-11-23 11:54:00,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:00,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:00,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:00,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:00,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:01,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {12215#true} call ULTIMATE.init(); {12215#true} is VALID [2018-11-23 11:54:01,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {12215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12215#true} is VALID [2018-11-23 11:54:01,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {12215#true} assume true; {12215#true} is VALID [2018-11-23 11:54:01,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12215#true} {12215#true} #105#return; {12215#true} is VALID [2018-11-23 11:54:01,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {12215#true} call #t~ret14 := main(); {12215#true} is VALID [2018-11-23 11:54:01,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {12215#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12217#(= main_~a~0 0)} is VALID [2018-11-23 11:54:01,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {12217#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12217#(= main_~a~0 0)} is VALID [2018-11-23 11:54:01,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {12217#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12218#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:01,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {12218#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12218#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:01,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {12218#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12219#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:01,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {12219#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12219#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:01,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {12219#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12220#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:01,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {12220#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12220#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:01,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {12220#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12221#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:01,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {12221#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12221#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:01,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {12221#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12222#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:01,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {12222#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12222#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:01,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {12222#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12223#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:01,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {12223#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12223#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:01,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {12223#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12224#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:01,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {12224#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12224#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:01,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {12224#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12225#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:01,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {12225#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12225#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:01,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {12225#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12226#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:01,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {12226#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12226#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:01,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {12226#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12227#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:01,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {12227#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12227#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:01,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {12227#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12228#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:01,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {12228#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12228#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:01,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {12228#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:01,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {12229#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12229#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:01,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {12229#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12230#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:01,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {12230#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12230#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:01,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {12230#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:01,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {12231#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12231#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:01,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {12231#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12232#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:01,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {12232#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12232#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:01,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {12232#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12233#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:01,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {12233#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12233#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:01,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {12233#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:01,237 INFO L273 TraceCheckUtils]: 40: Hoare triple {12234#(<= main_~a~0 17)} assume !(~a~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {12216#false} havoc ~i~0;~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,237 INFO L273 TraceCheckUtils]: 42: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,237 INFO L273 TraceCheckUtils]: 44: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,238 INFO L273 TraceCheckUtils]: 46: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,238 INFO L273 TraceCheckUtils]: 47: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,239 INFO L273 TraceCheckUtils]: 50: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,239 INFO L273 TraceCheckUtils]: 51: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,239 INFO L273 TraceCheckUtils]: 52: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,239 INFO L273 TraceCheckUtils]: 53: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,239 INFO L273 TraceCheckUtils]: 54: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,240 INFO L273 TraceCheckUtils]: 55: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,240 INFO L273 TraceCheckUtils]: 56: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,240 INFO L273 TraceCheckUtils]: 58: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,240 INFO L273 TraceCheckUtils]: 59: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {12216#false} ~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,241 INFO L273 TraceCheckUtils]: 62: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,241 INFO L273 TraceCheckUtils]: 63: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,241 INFO L273 TraceCheckUtils]: 64: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 65: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 66: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 67: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 69: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 70: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 71: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 72: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,242 INFO L273 TraceCheckUtils]: 73: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 74: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 75: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 76: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 77: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 78: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 79: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 80: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,243 INFO L273 TraceCheckUtils]: 81: Hoare triple {12216#false} ~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 82: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 83: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 84: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 85: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 86: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 87: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 88: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 89: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,244 INFO L273 TraceCheckUtils]: 90: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 91: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 92: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 93: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 94: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 95: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 96: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 97: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,245 INFO L273 TraceCheckUtils]: 98: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 99: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 100: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 101: Hoare triple {12216#false} ~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 102: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 103: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 104: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 105: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 106: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,246 INFO L273 TraceCheckUtils]: 107: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 108: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 109: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 110: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 111: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 112: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 113: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 114: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 115: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,247 INFO L273 TraceCheckUtils]: 116: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 117: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 118: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 119: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 120: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 121: Hoare triple {12216#false} havoc ~x~0;~x~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 122: Hoare triple {12216#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L256 TraceCheckUtils]: 123: Hoare triple {12216#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {12216#false} is VALID [2018-11-23 11:54:01,248 INFO L273 TraceCheckUtils]: 124: Hoare triple {12216#false} ~cond := #in~cond; {12216#false} is VALID [2018-11-23 11:54:01,249 INFO L273 TraceCheckUtils]: 125: Hoare triple {12216#false} assume 0 == ~cond; {12216#false} is VALID [2018-11-23 11:54:01,249 INFO L273 TraceCheckUtils]: 126: Hoare triple {12216#false} assume !false; {12216#false} is VALID [2018-11-23 11:54:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 11:54:01,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:01,256 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:54:01,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:01,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:01,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:01,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:01,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {12215#true} call ULTIMATE.init(); {12215#true} is VALID [2018-11-23 11:54:01,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {12215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12215#true} is VALID [2018-11-23 11:54:01,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {12215#true} assume true; {12215#true} is VALID [2018-11-23 11:54:01,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12215#true} {12215#true} #105#return; {12215#true} is VALID [2018-11-23 11:54:01,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {12215#true} call #t~ret14 := main(); {12215#true} is VALID [2018-11-23 11:54:01,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {12215#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {12253#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:01,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {12253#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12253#(<= main_~a~0 0)} is VALID [2018-11-23 11:54:01,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {12253#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12218#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:01,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {12218#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12218#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:01,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {12218#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12219#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:01,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {12219#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12219#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:01,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {12219#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12220#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:01,604 INFO L273 TraceCheckUtils]: 12: Hoare triple {12220#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12220#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:01,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {12220#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12221#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:01,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {12221#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12221#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:01,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {12221#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12222#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:01,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {12222#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12222#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:01,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {12222#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12223#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:01,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {12223#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12223#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:01,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {12223#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12224#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:01,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {12224#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12224#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:01,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {12224#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12225#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:01,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {12225#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12225#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:01,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {12225#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12226#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:01,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {12226#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12226#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:01,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {12226#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12227#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:01,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {12227#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12227#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:01,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {12227#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12228#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:01,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {12228#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12228#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:01,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {12228#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:01,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {12229#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12229#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:01,617 INFO L273 TraceCheckUtils]: 31: Hoare triple {12229#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12230#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:01,617 INFO L273 TraceCheckUtils]: 32: Hoare triple {12230#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12230#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:01,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {12230#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12231#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:01,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {12231#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12231#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:01,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {12231#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12232#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:01,620 INFO L273 TraceCheckUtils]: 36: Hoare triple {12232#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12232#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:01,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {12232#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12233#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:01,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {12233#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {12233#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:01,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {12233#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:01,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {12234#(<= main_~a~0 17)} assume !(~a~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,623 INFO L273 TraceCheckUtils]: 41: Hoare triple {12216#false} havoc ~i~0;~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,623 INFO L273 TraceCheckUtils]: 42: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,624 INFO L273 TraceCheckUtils]: 46: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,625 INFO L273 TraceCheckUtils]: 53: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,626 INFO L273 TraceCheckUtils]: 56: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,626 INFO L273 TraceCheckUtils]: 57: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {12216#false} is VALID [2018-11-23 11:54:01,626 INFO L273 TraceCheckUtils]: 59: Hoare triple {12216#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12216#false} is VALID [2018-11-23 11:54:01,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,626 INFO L273 TraceCheckUtils]: 61: Hoare triple {12216#false} ~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 62: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 64: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 65: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 66: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 67: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 68: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 69: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,627 INFO L273 TraceCheckUtils]: 70: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 71: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 72: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 73: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 74: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 75: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 76: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 77: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 78: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {12216#false} is VALID [2018-11-23 11:54:01,628 INFO L273 TraceCheckUtils]: 79: Hoare triple {12216#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 80: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 81: Hoare triple {12216#false} ~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 82: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 83: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 84: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 85: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 86: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,629 INFO L273 TraceCheckUtils]: 87: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 88: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 89: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 90: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 91: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 92: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 93: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 94: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 95: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,630 INFO L273 TraceCheckUtils]: 96: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 97: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 98: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 99: Hoare triple {12216#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 100: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 101: Hoare triple {12216#false} ~i~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 102: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 103: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 104: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,631 INFO L273 TraceCheckUtils]: 105: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 106: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 107: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 108: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 109: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 110: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 111: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 112: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,632 INFO L273 TraceCheckUtils]: 113: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 114: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 115: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 116: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 117: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 118: Hoare triple {12216#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 119: Hoare triple {12216#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 120: Hoare triple {12216#false} assume !(~i~0 < 100000); {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 121: Hoare triple {12216#false} havoc ~x~0;~x~0 := 0; {12216#false} is VALID [2018-11-23 11:54:01,633 INFO L273 TraceCheckUtils]: 122: Hoare triple {12216#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {12216#false} is VALID [2018-11-23 11:54:01,634 INFO L256 TraceCheckUtils]: 123: Hoare triple {12216#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {12216#false} is VALID [2018-11-23 11:54:01,634 INFO L273 TraceCheckUtils]: 124: Hoare triple {12216#false} ~cond := #in~cond; {12216#false} is VALID [2018-11-23 11:54:01,634 INFO L273 TraceCheckUtils]: 125: Hoare triple {12216#false} assume 0 == ~cond; {12216#false} is VALID [2018-11-23 11:54:01,634 INFO L273 TraceCheckUtils]: 126: Hoare triple {12216#false} assume !false; {12216#false} is VALID [2018-11-23 11:54:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 11:54:01,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:01,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:54:01,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 127 [2018-11-23 11:54:01,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:01,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:54:01,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:01,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:54:01,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:54:01,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:54:01,732 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 21 states. [2018-11-23 11:54:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,620 INFO L93 Difference]: Finished difference Result 226 states and 236 transitions. [2018-11-23 11:54:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:54:02,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 127 [2018-11-23 11:54:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:54:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 100 transitions. [2018-11-23 11:54:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:54:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 100 transitions. [2018-11-23 11:54:02,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 100 transitions. [2018-11-23 11:54:02,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:54:02,725 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:54:02,725 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 11:54:02,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:54:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 11:54:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-23 11:54:02,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:02,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-23 11:54:02,815 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-23 11:54:02,815 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-23 11:54:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,818 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-11-23 11:54:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-11-23 11:54:02,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:02,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:02,819 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-23 11:54:02,819 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-23 11:54:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:02,821 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-11-23 11:54:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2018-11-23 11:54:02,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:02,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:02,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:02,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 11:54:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2018-11-23 11:54:02,825 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 127 [2018-11-23 11:54:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:02,825 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2018-11-23 11:54:02,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:54:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2018-11-23 11:54:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-23 11:54:02,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:02,827 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:54:02,827 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:02,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1722961130, now seen corresponding path program 17 times [2018-11-23 11:54:02,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:02,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:02,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:02,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:03,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {13421#true} call ULTIMATE.init(); {13421#true} is VALID [2018-11-23 11:54:03,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {13421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13421#true} is VALID [2018-11-23 11:54:03,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {13421#true} assume true; {13421#true} is VALID [2018-11-23 11:54:03,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13421#true} {13421#true} #105#return; {13421#true} is VALID [2018-11-23 11:54:03,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {13421#true} call #t~ret14 := main(); {13421#true} is VALID [2018-11-23 11:54:03,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {13421#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {13423#(= main_~a~0 0)} is VALID [2018-11-23 11:54:03,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {13423#(= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13423#(= main_~a~0 0)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {13423#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13424#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {13424#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13424#(<= main_~a~0 1)} is VALID [2018-11-23 11:54:03,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {13424#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13425#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:03,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {13425#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13425#(<= main_~a~0 2)} is VALID [2018-11-23 11:54:03,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {13425#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13426#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {13426#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13426#(<= main_~a~0 3)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {13426#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13427#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:03,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {13427#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13427#(<= main_~a~0 4)} is VALID [2018-11-23 11:54:03,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {13427#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13428#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:03,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {13428#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13428#(<= main_~a~0 5)} is VALID [2018-11-23 11:54:03,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {13428#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13429#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:03,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {13429#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13429#(<= main_~a~0 6)} is VALID [2018-11-23 11:54:03,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {13429#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13430#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:03,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {13430#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13430#(<= main_~a~0 7)} is VALID [2018-11-23 11:54:03,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {13430#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13431#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:03,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {13431#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13431#(<= main_~a~0 8)} is VALID [2018-11-23 11:54:03,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {13431#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13432#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:03,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {13432#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13432#(<= main_~a~0 9)} is VALID [2018-11-23 11:54:03,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {13432#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13433#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:03,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {13433#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13433#(<= main_~a~0 10)} is VALID [2018-11-23 11:54:03,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {13433#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13434#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:03,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {13434#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13434#(<= main_~a~0 11)} is VALID [2018-11-23 11:54:03,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {13434#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13435#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:03,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {13435#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13435#(<= main_~a~0 12)} is VALID [2018-11-23 11:54:03,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {13435#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13436#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:03,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {13436#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13436#(<= main_~a~0 13)} is VALID [2018-11-23 11:54:03,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {13436#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13437#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:03,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {13437#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13437#(<= main_~a~0 14)} is VALID [2018-11-23 11:54:03,807 INFO L273 TraceCheckUtils]: 35: Hoare triple {13437#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13438#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:03,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {13438#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13438#(<= main_~a~0 15)} is VALID [2018-11-23 11:54:03,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {13438#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13439#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:03,809 INFO L273 TraceCheckUtils]: 38: Hoare triple {13439#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13439#(<= main_~a~0 16)} is VALID [2018-11-23 11:54:03,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {13439#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13440#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:03,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {13440#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {13440#(<= main_~a~0 17)} is VALID [2018-11-23 11:54:03,811 INFO L273 TraceCheckUtils]: 41: Hoare triple {13440#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {13441#(<= main_~a~0 18)} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {13441#(<= main_~a~0 18)} assume !(~a~0 < 100000); {13422#false} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 43: Hoare triple {13422#false} havoc ~i~0;~i~0 := 0; {13422#false} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 48: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 49: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 51: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 52: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 53: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 54: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,814 INFO L273 TraceCheckUtils]: 55: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 58: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 59: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 60: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {13422#false} is VALID [2018-11-23 11:54:03,815 INFO L273 TraceCheckUtils]: 61: Hoare triple {13422#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 62: Hoare triple {13422#false} assume !(~i~0 < 100000); {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 63: Hoare triple {13422#false} ~i~0 := 0; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 64: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 65: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 66: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 67: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 68: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 70: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 72: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 73: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 74: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,817 INFO L273 TraceCheckUtils]: 76: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 77: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 78: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 79: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 80: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {13422#false} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 81: Hoare triple {13422#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {13422#false} is VALID [2018-11-23 11:54:03,818 INFO L273 TraceCheckUtils]: 82: Hoare triple {13422#false} assume !(~i~0 < 100000); {13422#false} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 83: Hoare triple {13422#false} ~i~0 := 0; {13422#false} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 84: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 86: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 87: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,819 INFO L273 TraceCheckUtils]: 88: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 89: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 90: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 91: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 92: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,820 INFO L273 TraceCheckUtils]: 93: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 94: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 95: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 96: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 97: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 98: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,821 INFO L273 TraceCheckUtils]: 99: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 100: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {13422#false} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 101: Hoare triple {13422#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {13422#false} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {13422#false} assume !(~i~0 < 100000); {13422#false} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 103: Hoare triple {13422#false} ~i~0 := 0; {13422#false} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 104: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,822 INFO L273 TraceCheckUtils]: 105: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 106: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 107: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 108: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 109: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,823 INFO L273 TraceCheckUtils]: 110: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 111: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 112: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 113: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 114: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 115: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,824 INFO L273 TraceCheckUtils]: 116: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 117: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 118: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 119: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 120: Hoare triple {13422#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + 4 * ~i~0, 4);havoc #t~mem10; {13422#false} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 121: Hoare triple {13422#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {13422#false} is VALID [2018-11-23 11:54:03,825 INFO L273 TraceCheckUtils]: 122: Hoare triple {13422#false} assume !(~i~0 < 100000); {13422#false} is VALID [2018-11-23 11:54:03,826 INFO L273 TraceCheckUtils]: 123: Hoare triple {13422#false} havoc ~x~0;~x~0 := 0; {13422#false} is VALID [2018-11-23 11:54:03,826 INFO L273 TraceCheckUtils]: 124: Hoare triple {13422#false} assume !!(~x~0 < 100000);call #t~mem12 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem13 := read~int(~#a5~0.base, ~#a5~0.offset + 4 * ~x~0, 4); {13422#false} is VALID [2018-11-23 11:54:03,826 INFO L256 TraceCheckUtils]: 125: Hoare triple {13422#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1 else 0)); {13422#false} is VALID [2018-11-23 11:54:03,826 INFO L273 TraceCheckUtils]: 126: Hoare triple {13422#false} ~cond := #in~cond; {13422#false} is VALID [2018-11-23 11:54:03,826 INFO L273 TraceCheckUtils]: 127: Hoare triple {13422#false} assume 0 == ~cond; {13422#false} is VALID [2018-11-23 11:54:03,826 INFO L273 TraceCheckUtils]: 128: Hoare triple {13422#false} assume !false; {13422#false} is VALID [2018-11-23 11:54:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 11:54:03,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:03,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1