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_copy3_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,236 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,288 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,292 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,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,316 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,321 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,322 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,322 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,324 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,324 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,325 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,325 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,325 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,326 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,327 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,327 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,330 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,420 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,421 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_false-unreach-call_ground.i [2018-11-23 11:51:45,482 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d3477aa/b19ae292acef4ba98e95281026fea876/FLAG3710a106a [2018-11-23 11:51:45,895 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,896 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_false-unreach-call_ground.i [2018-11-23 11:51:45,902 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d3477aa/b19ae292acef4ba98e95281026fea876/FLAG3710a106a [2018-11-23 11:51:46,290 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11d3477aa/b19ae292acef4ba98e95281026fea876 [2018-11-23 11:51:46,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,307 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,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 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,310 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,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,346 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,626 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,658 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,687 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,687 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,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,689 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,725 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (1/1) ... [2018-11-23 11:51:46,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,802 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,804 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:46,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:46,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:46,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:46,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:47,804 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:47,804 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 11:51:47,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47 BoogieIcfgContainer [2018-11-23 11:51:47,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:47,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:47,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:47,810 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:47,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:46" (1/3) ... [2018-11-23 11:51:47,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f1c7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:46" (2/3) ... [2018-11-23 11:51:47,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f1c7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:47, skipping insertion in model container [2018-11-23 11:51:47,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:47" (3/3) ... [2018-11-23 11:51:47,814 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy3_false-unreach-call_ground.i [2018-11-23 11:51:47,825 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:47,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:47,851 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:47,883 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:47,883 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:47,883 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:47,883 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:47,884 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:47,884 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:47,884 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:47,884 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:47,884 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 11:51:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:47,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:47,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -496428460, now seen corresponding path program 1 times [2018-11-23 11:51:47,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 11:51:48,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-23 11:51:48,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 11:51:48,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #91#return; {36#true} is VALID [2018-11-23 11:51:48,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret12 := main(); {36#true} is VALID [2018-11-23 11:51:48,080 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#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);havoc ~a~0;~a~0 := 0; {36#true} is VALID [2018-11-23 11:51:48,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 11:51:48,081 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~i~0;~i~0 := 0; {37#false} is VALID [2018-11-23 11:51:48,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:51:48,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:51:48,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:51:48,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-23 11:51:48,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !(~i~0 < 100000); {37#false} is VALID [2018-11-23 11:51:48,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-23 11:51:48,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {37#false} is VALID [2018-11-23 11:51:48,083 INFO L256 TraceCheckUtils]: 15: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {37#false} is VALID [2018-11-23 11:51:48,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-23 11:51:48,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-23 11:51:48,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 11:51:48,088 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,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:48,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:51:48,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:48,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:48,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,372 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 11:51:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,509 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 11:51:48,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 11:51:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 11:51:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 11:51:48,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 11:51:48,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:48,834 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:51:48,835 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:51:48,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:51:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:51:48,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:48,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:51:48,889 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:51:48,889 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:51:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,894 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 11:51:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:51:48,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,895 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:51:48,896 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:51:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,900 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 11:51:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:51:48,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:48,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:51:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 11:51:48,906 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2018-11-23 11:51:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:48,907 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 11:51:48,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:51:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:48,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:48,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1263989582, now seen corresponding path program 1 times [2018-11-23 11:51:48,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 11:51:49,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {210#true} is VALID [2018-11-23 11:51:49,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 11:51:49,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #91#return; {210#true} is VALID [2018-11-23 11:51:49,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret12 := main(); {210#true} is VALID [2018-11-23 11:51:49,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#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);havoc ~a~0;~a~0 := 0; {212#(= main_~a~0 0)} is VALID [2018-11-23 11:51:49,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#(= main_~a~0 0)} assume !(~a~0 < 100000); {211#false} is VALID [2018-11-23 11:51:49,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {211#false} havoc ~i~0;~i~0 := 0; {211#false} is VALID [2018-11-23 11:51:49,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {211#false} assume !(~i~0 < 100000); {211#false} is VALID [2018-11-23 11:51:49,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {211#false} ~i~0 := 0; {211#false} is VALID [2018-11-23 11:51:49,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {211#false} assume !(~i~0 < 100000); {211#false} is VALID [2018-11-23 11:51:49,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {211#false} ~i~0 := 0; {211#false} is VALID [2018-11-23 11:51:49,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {211#false} assume !(~i~0 < 100000); {211#false} is VALID [2018-11-23 11:51:49,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {211#false} havoc ~x~0;~x~0 := 0; {211#false} is VALID [2018-11-23 11:51:49,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {211#false} is VALID [2018-11-23 11:51:49,040 INFO L256 TraceCheckUtils]: 15: Hoare triple {211#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {211#false} is VALID [2018-11-23 11:51:49,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {211#false} ~cond := #in~cond; {211#false} is VALID [2018-11-23 11:51:49,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {211#false} assume 0 == ~cond; {211#false} is VALID [2018-11-23 11:51:49,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 11:51:49,043 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,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:51:49,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,129 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 11:51:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,578 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 11:51:49,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:51:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 11:51:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 11:51:49,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 11:51:49,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:49,732 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:51:49,732 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:51:49,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:51:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 11:51:49,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 11:51:49,754 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 11:51:49,754 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 11:51:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,757 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:51:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 11:51:49,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,759 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 11:51:49,759 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 11:51:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,762 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:51:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 11:51:49,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:51:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 11:51:49,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2018-11-23 11:51:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,766 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 11:51:49,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:51:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:51:49,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,767 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,768 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1258945684, now seen corresponding path program 1 times [2018-11-23 11:51:49,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-23 11:51:49,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {384#true} is VALID [2018-11-23 11:51:49,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-23 11:51:49,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {384#true} {384#true} #91#return; {384#true} is VALID [2018-11-23 11:51:49,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {384#true} call #t~ret12 := main(); {384#true} is VALID [2018-11-23 11:51:49,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {384#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);havoc ~a~0;~a~0 := 0; {384#true} is VALID [2018-11-23 11:51:49,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {384#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {384#true} is VALID [2018-11-23 11:51:49,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {384#true} is VALID [2018-11-23 11:51:49,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#true} assume !(~a~0 < 100000); {384#true} is VALID [2018-11-23 11:51:49,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {384#true} havoc ~i~0;~i~0 := 0; {386#(= main_~i~0 0)} is VALID [2018-11-23 11:51:49,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#(= main_~i~0 0)} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-23 11:51:49,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#false} ~i~0 := 0; {385#false} is VALID [2018-11-23 11:51:49,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#false} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-23 11:51:49,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#false} ~i~0 := 0; {385#false} is VALID [2018-11-23 11:51:49,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {385#false} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-23 11:51:49,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {385#false} havoc ~x~0;~x~0 := 0; {385#false} is VALID [2018-11-23 11:51:49,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {385#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {385#false} is VALID [2018-11-23 11:51:49,962 INFO L256 TraceCheckUtils]: 17: Hoare triple {385#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {385#false} is VALID [2018-11-23 11:51:49,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-23 11:51:49,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2018-11-23 11:51:49,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-23 11:51:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:49,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:51:49,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:50,066 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:50,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:50,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,068 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-23 11:51:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,320 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-23 11:51:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:51:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 11:51:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 11:51:50,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 11:51:50,480 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:51:50,482 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:51:50,482 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:51:50,483 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,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:51:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 11:51:50,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 11:51:50,521 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 11:51:50,521 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 11:51:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,524 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:51:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:51:50,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,526 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 11:51:50,526 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 11:51:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,529 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:51:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:51:50,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:51:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 11:51:50,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2018-11-23 11:51:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,533 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 11:51:50,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 11:51:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:51:50,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,534 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] [2018-11-23 11:51:50,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1930458438, now seen corresponding path program 1 times [2018-11-23 11:51:50,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-23 11:51:50,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {578#true} is VALID [2018-11-23 11:51:50,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-23 11:51:50,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #91#return; {578#true} is VALID [2018-11-23 11:51:50,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret12 := main(); {578#true} is VALID [2018-11-23 11:51:50,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#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);havoc ~a~0;~a~0 := 0; {580#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {580#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {580#(= main_~a~0 0)} is VALID [2018-11-23 11:51:50,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {580#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {581#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:50,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {581#(<= main_~a~0 1)} assume !(~a~0 < 100000); {579#false} is VALID [2018-11-23 11:51:50,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {579#false} havoc ~i~0;~i~0 := 0; {579#false} is VALID [2018-11-23 11:51:50,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {579#false} 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; {579#false} is VALID [2018-11-23 11:51:50,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {579#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {579#false} is VALID [2018-11-23 11:51:50,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:51:50,684 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:51:50,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {579#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {579#false} is VALID [2018-11-23 11:51:50,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {579#false} is VALID [2018-11-23 11:51:50,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:51:50,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:51:50,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {579#false} is VALID [2018-11-23 11:51:50,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {579#false} is VALID [2018-11-23 11:51:50,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:51:50,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {579#false} havoc ~x~0;~x~0 := 0; {579#false} is VALID [2018-11-23 11:51:50,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {579#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {579#false} is VALID [2018-11-23 11:51:50,687 INFO L256 TraceCheckUtils]: 23: Hoare triple {579#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {579#false} is VALID [2018-11-23 11:51:50,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2018-11-23 11:51:50,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {579#false} assume 0 == ~cond; {579#false} is VALID [2018-11-23 11:51:50,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-23 11:51:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:51:50,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:50,690 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,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:51,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {578#true} call ULTIMATE.init(); {578#true} is VALID [2018-11-23 11:51:51,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {578#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {578#true} is VALID [2018-11-23 11:51:51,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {578#true} assume true; {578#true} is VALID [2018-11-23 11:51:51,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {578#true} {578#true} #91#return; {578#true} is VALID [2018-11-23 11:51:51,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {578#true} call #t~ret12 := main(); {578#true} is VALID [2018-11-23 11:51:51,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {578#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);havoc ~a~0;~a~0 := 0; {600#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {600#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {600#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:51,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {600#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {581#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {581#(<= main_~a~0 1)} assume !(~a~0 < 100000); {579#false} is VALID [2018-11-23 11:51:51,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {579#false} havoc ~i~0;~i~0 := 0; {579#false} is VALID [2018-11-23 11:51:51,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {579#false} 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; {579#false} is VALID [2018-11-23 11:51:51,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {579#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {579#false} is VALID [2018-11-23 11:51:51,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:51:51,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:51:51,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {579#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {579#false} is VALID [2018-11-23 11:51:51,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {579#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {579#false} is VALID [2018-11-23 11:51:51,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:51:51,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {579#false} ~i~0 := 0; {579#false} is VALID [2018-11-23 11:51:51,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {579#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {579#false} is VALID [2018-11-23 11:51:51,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {579#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {579#false} is VALID [2018-11-23 11:51:51,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {579#false} assume !(~i~0 < 100000); {579#false} is VALID [2018-11-23 11:51:51,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {579#false} havoc ~x~0;~x~0 := 0; {579#false} is VALID [2018-11-23 11:51:51,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {579#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {579#false} is VALID [2018-11-23 11:51:51,123 INFO L256 TraceCheckUtils]: 23: Hoare triple {579#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {579#false} is VALID [2018-11-23 11:51:51,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {579#false} ~cond := #in~cond; {579#false} is VALID [2018-11-23 11:51:51,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {579#false} assume 0 == ~cond; {579#false} is VALID [2018-11-23 11:51:51,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {579#false} assume !false; {579#false} is VALID [2018-11-23 11:51:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:51:51,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:51,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 11:51:51,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:51,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:51,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:51,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,199 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2018-11-23 11:51:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,611 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 11:51:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 11:51:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:51:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 11:51:51,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 11:51:51,754 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:51:51,756 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:51:51,757 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:51:51,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:51:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 11:51:51,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 11:51:51,813 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 11:51:51,813 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 11:51:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,817 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:51:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:51:51,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,818 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 11:51:51,818 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 11:51:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,821 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:51:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:51:51,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:51:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 11:51:51,824 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-23 11:51:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,825 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 11:51:51,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:51:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:51:51,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,826 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] [2018-11-23 11:51:51,826 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1956939620, now seen corresponding path program 2 times [2018-11-23 11:51:51,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 11:51:51,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {866#true} is VALID [2018-11-23 11:51:51,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:51:51,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #91#return; {866#true} is VALID [2018-11-23 11:51:51,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret12 := main(); {866#true} is VALID [2018-11-23 11:51:51,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#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);havoc ~a~0;~a~0 := 0; {868#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {868#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {868#(= main_~a~0 0)} is VALID [2018-11-23 11:51:51,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {868#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {869#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {869#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {869#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:51,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {869#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {870#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:51,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(<= main_~a~0 2)} assume !(~a~0 < 100000); {867#false} is VALID [2018-11-23 11:51:51,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#false} havoc ~i~0;~i~0 := 0; {867#false} is VALID [2018-11-23 11:51:51,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {867#false} 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; {867#false} is VALID [2018-11-23 11:51:52,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {867#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {867#false} is VALID [2018-11-23 11:51:52,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:51:52,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2018-11-23 11:51:52,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {867#false} is VALID [2018-11-23 11:51:52,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {867#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {867#false} is VALID [2018-11-23 11:51:52,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:51:52,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2018-11-23 11:51:52,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {867#false} is VALID [2018-11-23 11:51:52,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {867#false} is VALID [2018-11-23 11:51:52,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:51:52,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {867#false} havoc ~x~0;~x~0 := 0; {867#false} is VALID [2018-11-23 11:51:52,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {867#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {867#false} is VALID [2018-11-23 11:51:52,003 INFO L256 TraceCheckUtils]: 25: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {867#false} is VALID [2018-11-23 11:51:52,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2018-11-23 11:51:52,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2018-11-23 11:51:52,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 11:51:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:51:52,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,006 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,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:52,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 11:51:52,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {866#true} is VALID [2018-11-23 11:51:52,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:51:52,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #91#return; {866#true} is VALID [2018-11-23 11:51:52,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret12 := main(); {866#true} is VALID [2018-11-23 11:51:52,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#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);havoc ~a~0;~a~0 := 0; {866#true} is VALID [2018-11-23 11:51:52,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {866#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {866#true} is VALID [2018-11-23 11:51:52,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {866#true} is VALID [2018-11-23 11:51:52,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {866#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {866#true} is VALID [2018-11-23 11:51:52,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {866#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {866#true} is VALID [2018-11-23 11:51:52,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {866#true} assume !(~a~0 < 100000); {866#true} is VALID [2018-11-23 11:51:52,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {866#true} havoc ~i~0;~i~0 := 0; {866#true} is VALID [2018-11-23 11:51:52,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {866#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; {866#true} is VALID [2018-11-23 11:51:52,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {866#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {866#true} is VALID [2018-11-23 11:51:52,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {866#true} assume !(~i~0 < 100000); {866#true} is VALID [2018-11-23 11:51:52,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {866#true} ~i~0 := 0; {919#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {919#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {919#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:52,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {919#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {926#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {926#(<= main_~i~0 1)} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:51:52,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} ~i~0 := 0; {867#false} is VALID [2018-11-23 11:51:52,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {867#false} is VALID [2018-11-23 11:51:52,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {867#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {867#false} is VALID [2018-11-23 11:51:52,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} assume !(~i~0 < 100000); {867#false} is VALID [2018-11-23 11:51:52,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {867#false} havoc ~x~0;~x~0 := 0; {867#false} is VALID [2018-11-23 11:51:52,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {867#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {867#false} is VALID [2018-11-23 11:51:52,207 INFO L256 TraceCheckUtils]: 25: Hoare triple {867#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {867#false} is VALID [2018-11-23 11:51:52,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2018-11-23 11:51:52,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2018-11-23 11:51:52,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 11:51:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:51:52,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 11:51:52,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 11:51:52,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:52,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:52,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:52,293 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-23 11:51:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,702 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 11:51:52,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:52,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 11:51:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 11:51:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 11:51:52,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 11:51:52,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:52,833 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:51:52,834 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 11:51:52,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 11:51:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-23 11:51:52,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-23 11:51:52,883 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-23 11:51:52,883 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-23 11:51:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,885 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 11:51:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 11:51:52,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,888 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-23 11:51:52,888 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-23 11:51:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,891 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 11:51:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 11:51:52,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:51:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 11:51:52,894 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2018-11-23 11:51:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,895 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 11:51:52,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:51:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:51:52,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,897 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-23 11:51:52,897 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1304628388, now seen corresponding path program 3 times [2018-11-23 11:51:52,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2018-11-23 11:51:53,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1211#true} is VALID [2018-11-23 11:51:53,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2018-11-23 11:51:53,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #91#return; {1211#true} is VALID [2018-11-23 11:51:53,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret12 := main(); {1211#true} is VALID [2018-11-23 11:51:53,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {1211#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);havoc ~a~0;~a~0 := 0; {1213#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {1213#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1213#(= main_~a~0 0)} is VALID [2018-11-23 11:51:53,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {1213#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1214#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {1214#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1214#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:53,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {1214#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1215#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {1215#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1215#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:53,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {1215#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1216#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:53,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {1216#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1212#false} is VALID [2018-11-23 11:51:53,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {1212#false} havoc ~i~0;~i~0 := 0; {1212#false} is VALID [2018-11-23 11:51:53,090 INFO L273 TraceCheckUtils]: 14: Hoare triple {1212#false} 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; {1212#false} is VALID [2018-11-23 11:51:53,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {1212#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1212#false} is VALID [2018-11-23 11:51:53,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1212#false} 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; {1212#false} is VALID [2018-11-23 11:51:53,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {1212#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1212#false} is VALID [2018-11-23 11:51:53,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:51:53,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {1212#false} ~i~0 := 0; {1212#false} is VALID [2018-11-23 11:51:53,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {1212#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1212#false} is VALID [2018-11-23 11:51:53,093 INFO L273 TraceCheckUtils]: 21: Hoare triple {1212#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1212#false} is VALID [2018-11-23 11:51:53,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {1212#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1212#false} is VALID [2018-11-23 11:51:53,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {1212#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1212#false} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 24: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {1212#false} ~i~0 := 0; {1212#false} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {1212#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1212#false} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {1212#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1212#false} is VALID [2018-11-23 11:51:53,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {1212#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1212#false} is VALID [2018-11-23 11:51:53,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {1212#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1212#false} is VALID [2018-11-23 11:51:53,095 INFO L273 TraceCheckUtils]: 30: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:51:53,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {1212#false} havoc ~x~0;~x~0 := 0; {1212#false} is VALID [2018-11-23 11:51:53,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {1212#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1212#false} is VALID [2018-11-23 11:51:53,095 INFO L256 TraceCheckUtils]: 33: Hoare triple {1212#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1212#false} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2018-11-23 11:51:53,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2018-11-23 11:51:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:51:53,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,099 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,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:53,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:51:53,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:53,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2018-11-23 11:51:53,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1211#true} is VALID [2018-11-23 11:51:53,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2018-11-23 11:51:53,312 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #91#return; {1211#true} is VALID [2018-11-23 11:51:53,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret12 := main(); {1211#true} is VALID [2018-11-23 11:51:53,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {1211#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);havoc ~a~0;~a~0 := 0; {1211#true} is VALID [2018-11-23 11:51:53,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {1211#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1211#true} is VALID [2018-11-23 11:51:53,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {1211#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1211#true} is VALID [2018-11-23 11:51:53,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {1211#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1211#true} is VALID [2018-11-23 11:51:53,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {1211#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1211#true} is VALID [2018-11-23 11:51:53,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {1211#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1211#true} is VALID [2018-11-23 11:51:53,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {1211#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1211#true} is VALID [2018-11-23 11:51:53,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {1211#true} assume !(~a~0 < 100000); {1211#true} is VALID [2018-11-23 11:51:53,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {1211#true} havoc ~i~0;~i~0 := 0; {1211#true} is VALID [2018-11-23 11:51:53,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:51:53,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {1211#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1211#true} is VALID [2018-11-23 11:51:53,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {1211#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; {1211#true} is VALID [2018-11-23 11:51:53,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {1211#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1211#true} is VALID [2018-11-23 11:51:53,316 INFO L273 TraceCheckUtils]: 18: Hoare triple {1211#true} assume !(~i~0 < 100000); {1211#true} is VALID [2018-11-23 11:51:53,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {1211#true} ~i~0 := 0; {1277#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1277#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:53,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {1284#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1284#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {1284#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1291#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {1291#(<= main_~i~0 2)} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:51:53,326 INFO L273 TraceCheckUtils]: 25: Hoare triple {1212#false} ~i~0 := 0; {1212#false} is VALID [2018-11-23 11:51:53,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {1212#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1212#false} is VALID [2018-11-23 11:51:53,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {1212#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1212#false} is VALID [2018-11-23 11:51:53,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {1212#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1212#false} is VALID [2018-11-23 11:51:53,327 INFO L273 TraceCheckUtils]: 29: Hoare triple {1212#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1212#false} is VALID [2018-11-23 11:51:53,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {1212#false} assume !(~i~0 < 100000); {1212#false} is VALID [2018-11-23 11:51:53,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {1212#false} havoc ~x~0;~x~0 := 0; {1212#false} is VALID [2018-11-23 11:51:53,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {1212#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1212#false} is VALID [2018-11-23 11:51:53,328 INFO L256 TraceCheckUtils]: 33: Hoare triple {1212#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1212#false} is VALID [2018-11-23 11:51:53,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {1212#false} ~cond := #in~cond; {1212#false} is VALID [2018-11-23 11:51:53,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {1212#false} assume 0 == ~cond; {1212#false} is VALID [2018-11-23 11:51:53,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2018-11-23 11:51:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 11:51:53,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 11:51:53,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:51:53,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:53,440 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:53,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:53,442 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 9 states. [2018-11-23 11:51:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,750 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-23 11:51:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:53,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:51:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2018-11-23 11:51:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2018-11-23 11:51:53,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 85 transitions. [2018-11-23 11:51:53,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:53,864 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:51:53,864 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:51:53,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 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:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:51:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-23 11:51:53,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-23 11:51:53,916 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-23 11:51:53,916 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-23 11:51:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,919 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 11:51:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 11:51:53,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,920 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-23 11:51:53,920 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-23 11:51:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,923 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 11:51:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 11:51:53,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:51:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-23 11:51:53,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2018-11-23 11:51:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,927 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-23 11:51:53,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 11:51:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:51:53,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,929 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 11:51:53,929 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 849823572, now seen corresponding path program 4 times [2018-11-23 11:51:53,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-23 11:51:54,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {1631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1631#true} is VALID [2018-11-23 11:51:54,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-23 11:51:54,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #91#return; {1631#true} is VALID [2018-11-23 11:51:54,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret12 := main(); {1631#true} is VALID [2018-11-23 11:51:54,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#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);havoc ~a~0;~a~0 := 0; {1633#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {1633#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1633#(= main_~a~0 0)} is VALID [2018-11-23 11:51:54,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {1633#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {1634#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {1634#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {1635#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {1636#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {1636#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1637#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {1637#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {1632#false} havoc ~i~0;~i~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {1632#false} 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; {1632#false} is VALID [2018-11-23 11:51:54,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {1632#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1632#false} is VALID [2018-11-23 11:51:54,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {1632#false} 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; {1632#false} is VALID [2018-11-23 11:51:54,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {1632#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1632#false} is VALID [2018-11-23 11:51:54,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {1632#false} 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; {1632#false} is VALID [2018-11-23 11:51:54,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {1632#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1632#false} is VALID [2018-11-23 11:51:54,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1632#false} is VALID [2018-11-23 11:51:54,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {1632#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1632#false} is VALID [2018-11-23 11:51:54,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1632#false} is VALID [2018-11-23 11:51:54,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {1632#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1632#false} is VALID [2018-11-23 11:51:54,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1632#false} is VALID [2018-11-23 11:51:54,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {1632#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1632#false} is VALID [2018-11-23 11:51:54,135 INFO L273 TraceCheckUtils]: 30: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1632#false} is VALID [2018-11-23 11:51:54,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1632#false} is VALID [2018-11-23 11:51:54,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1632#false} is VALID [2018-11-23 11:51:54,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {1632#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1632#false} is VALID [2018-11-23 11:51:54,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1632#false} is VALID [2018-11-23 11:51:54,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {1632#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1632#false} is VALID [2018-11-23 11:51:54,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {1632#false} havoc ~x~0;~x~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {1632#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1632#false} is VALID [2018-11-23 11:51:54,137 INFO L256 TraceCheckUtils]: 41: Hoare triple {1632#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1632#false} is VALID [2018-11-23 11:51:54,137 INFO L273 TraceCheckUtils]: 42: Hoare triple {1632#false} ~cond := #in~cond; {1632#false} is VALID [2018-11-23 11:51:54,137 INFO L273 TraceCheckUtils]: 43: Hoare triple {1632#false} assume 0 == ~cond; {1632#false} is VALID [2018-11-23 11:51:54,137 INFO L273 TraceCheckUtils]: 44: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-23 11:51:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:51:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,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 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,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:54,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:54,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-23 11:51:54,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {1631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1631#true} is VALID [2018-11-23 11:51:54,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-23 11:51:54,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #91#return; {1631#true} is VALID [2018-11-23 11:51:54,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret12 := main(); {1631#true} is VALID [2018-11-23 11:51:54,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#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);havoc ~a~0;~a~0 := 0; {1656#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:54,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {1656#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1656#(<= main_~a~0 0)} is VALID [2018-11-23 11:51:54,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {1656#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {1634#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1634#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:54,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {1634#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1635#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:54,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {1635#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {1636#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {1636#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:54,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {1636#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {1637#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:54,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {1637#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {1632#false} havoc ~i~0;~i~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {1632#false} 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; {1632#false} is VALID [2018-11-23 11:51:54,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {1632#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1632#false} is VALID [2018-11-23 11:51:54,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {1632#false} 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; {1632#false} is VALID [2018-11-23 11:51:54,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {1632#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1632#false} is VALID [2018-11-23 11:51:54,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {1632#false} 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; {1632#false} is VALID [2018-11-23 11:51:54,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {1632#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1632#false} is VALID [2018-11-23 11:51:54,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1632#false} is VALID [2018-11-23 11:51:54,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {1632#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1632#false} is VALID [2018-11-23 11:51:54,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1632#false} is VALID [2018-11-23 11:51:54,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {1632#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1632#false} is VALID [2018-11-23 11:51:54,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {1632#false} is VALID [2018-11-23 11:51:54,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {1632#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1632#false} is VALID [2018-11-23 11:51:54,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {1632#false} ~i~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1632#false} is VALID [2018-11-23 11:51:54,347 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1632#false} is VALID [2018-11-23 11:51:54,347 INFO L273 TraceCheckUtils]: 34: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1632#false} is VALID [2018-11-23 11:51:54,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {1632#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1632#false} is VALID [2018-11-23 11:51:54,347 INFO L273 TraceCheckUtils]: 36: Hoare triple {1632#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {1632#false} is VALID [2018-11-23 11:51:54,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {1632#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {1632#false} is VALID [2018-11-23 11:51:54,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {1632#false} assume !(~i~0 < 100000); {1632#false} is VALID [2018-11-23 11:51:54,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {1632#false} havoc ~x~0;~x~0 := 0; {1632#false} is VALID [2018-11-23 11:51:54,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {1632#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {1632#false} is VALID [2018-11-23 11:51:54,348 INFO L256 TraceCheckUtils]: 41: Hoare triple {1632#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {1632#false} is VALID [2018-11-23 11:51:54,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {1632#false} ~cond := #in~cond; {1632#false} is VALID [2018-11-23 11:51:54,349 INFO L273 TraceCheckUtils]: 43: Hoare triple {1632#false} assume 0 == ~cond; {1632#false} is VALID [2018-11-23 11:51:54,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-23 11:51:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:51:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:54,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-23 11:51:54,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:54,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:54,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:54,596 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-11-23 11:51:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,984 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-23 11:51:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:54,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-23 11:51:54,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 11:51:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 11:51:54,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-23 11:51:55,093 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:55,095 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:51:55,095 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:51:55,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:51:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 11:51:55,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:55,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 11:51:55,139 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 11:51:55,139 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 11:51:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,142 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 11:51:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 11:51:55,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,143 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 11:51:55,144 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 11:51:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,146 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-23 11:51:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 11:51:55,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:55,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:51:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-23 11:51:55,149 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 45 [2018-11-23 11:51:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:55,149 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 11:51:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 11:51:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:51:55,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:55,151 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-23 11:51:55,151 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:55,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1944957454, now seen corresponding path program 5 times [2018-11-23 11:51:55,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {2084#true} call ULTIMATE.init(); {2084#true} is VALID [2018-11-23 11:51:55,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {2084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2084#true} is VALID [2018-11-23 11:51:55,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {2084#true} assume true; {2084#true} is VALID [2018-11-23 11:51:55,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2084#true} {2084#true} #91#return; {2084#true} is VALID [2018-11-23 11:51:55,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {2084#true} call #t~ret12 := main(); {2084#true} is VALID [2018-11-23 11:51:55,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {2084#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);havoc ~a~0;~a~0 := 0; {2086#(= main_~a~0 0)} is VALID [2018-11-23 11:51:55,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {2086#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2086#(= main_~a~0 0)} is VALID [2018-11-23 11:51:55,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {2086#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2087#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {2087#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2087#(<= main_~a~0 1)} is VALID [2018-11-23 11:51:55,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {2087#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2088#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {2088#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2088#(<= main_~a~0 2)} is VALID [2018-11-23 11:51:55,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {2088#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2089#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {2089#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2089#(<= main_~a~0 3)} is VALID [2018-11-23 11:51:55,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {2089#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2090#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:55,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {2090#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2090#(<= main_~a~0 4)} is VALID [2018-11-23 11:51:55,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {2090#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2091#(<= main_~a~0 5)} is VALID [2018-11-23 11:51:55,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {2091#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:55,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {2085#false} havoc ~i~0;~i~0 := 0; {2085#false} is VALID [2018-11-23 11:51:55,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {2085#false} 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; {2085#false} is VALID [2018-11-23 11:51:55,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {2085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2085#false} is VALID [2018-11-23 11:51:55,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {2085#false} 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; {2085#false} is VALID [2018-11-23 11:51:55,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {2085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2085#false} is VALID [2018-11-23 11:51:55,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {2085#false} 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; {2085#false} is VALID [2018-11-23 11:51:55,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {2085#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2085#false} is VALID [2018-11-23 11:51:55,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:55,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:51:55,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2085#false} is VALID [2018-11-23 11:51:55,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {2085#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#false} is VALID [2018-11-23 11:51:55,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2085#false} is VALID [2018-11-23 11:51:55,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {2085#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#false} is VALID [2018-11-23 11:51:55,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2085#false} is VALID [2018-11-23 11:51:55,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {2085#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#false} is VALID [2018-11-23 11:51:55,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:55,505 INFO L273 TraceCheckUtils]: 33: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:51:55,505 INFO L273 TraceCheckUtils]: 34: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2085#false} is VALID [2018-11-23 11:51:55,505 INFO L273 TraceCheckUtils]: 35: Hoare triple {2085#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2085#false} is VALID [2018-11-23 11:51:55,506 INFO L273 TraceCheckUtils]: 36: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2085#false} is VALID [2018-11-23 11:51:55,506 INFO L273 TraceCheckUtils]: 37: Hoare triple {2085#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2085#false} is VALID [2018-11-23 11:51:55,506 INFO L273 TraceCheckUtils]: 38: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2085#false} is VALID [2018-11-23 11:51:55,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {2085#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2085#false} is VALID [2018-11-23 11:51:55,507 INFO L273 TraceCheckUtils]: 40: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:55,507 INFO L273 TraceCheckUtils]: 41: Hoare triple {2085#false} havoc ~x~0;~x~0 := 0; {2085#false} is VALID [2018-11-23 11:51:55,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {2085#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2085#false} is VALID [2018-11-23 11:51:55,507 INFO L256 TraceCheckUtils]: 43: Hoare triple {2085#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2085#false} is VALID [2018-11-23 11:51:55,508 INFO L273 TraceCheckUtils]: 44: Hoare triple {2085#false} ~cond := #in~cond; {2085#false} is VALID [2018-11-23 11:51:55,508 INFO L273 TraceCheckUtils]: 45: Hoare triple {2085#false} assume 0 == ~cond; {2085#false} is VALID [2018-11-23 11:51:55,508 INFO L273 TraceCheckUtils]: 46: Hoare triple {2085#false} assume !false; {2085#false} is VALID [2018-11-23 11:51:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 11:51:55,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:55,512 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:55,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:58,987 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:58,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {2084#true} call ULTIMATE.init(); {2084#true} is VALID [2018-11-23 11:51:59,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {2084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2084#true} is VALID [2018-11-23 11:51:59,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {2084#true} assume true; {2084#true} is VALID [2018-11-23 11:51:59,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2084#true} {2084#true} #91#return; {2084#true} is VALID [2018-11-23 11:51:59,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {2084#true} call #t~ret12 := main(); {2084#true} is VALID [2018-11-23 11:51:59,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {2084#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);havoc ~a~0;~a~0 := 0; {2084#true} is VALID [2018-11-23 11:51:59,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {2084#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2084#true} is VALID [2018-11-23 11:51:59,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:51:59,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {2084#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2084#true} is VALID [2018-11-23 11:51:59,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:51:59,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {2084#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2084#true} is VALID [2018-11-23 11:51:59,196 INFO L273 TraceCheckUtils]: 11: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:51:59,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {2084#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2084#true} is VALID [2018-11-23 11:51:59,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:51:59,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {2084#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2084#true} is VALID [2018-11-23 11:51:59,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {2084#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2084#true} is VALID [2018-11-23 11:51:59,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {2084#true} assume !(~a~0 < 100000); {2084#true} is VALID [2018-11-23 11:51:59,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {2084#true} havoc ~i~0;~i~0 := 0; {2146#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {2146#(<= 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; {2146#(<= main_~i~0 0)} is VALID [2018-11-23 11:51:59,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {2146#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2153#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {2153#(<= 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; {2153#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {2153#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2160#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {2160#(<= 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; {2160#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {2160#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2167#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {2167#(<= main_~i~0 3)} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:59,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:51:59,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2085#false} is VALID [2018-11-23 11:51:59,201 INFO L273 TraceCheckUtils]: 27: Hoare triple {2085#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#false} is VALID [2018-11-23 11:51:59,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2085#false} is VALID [2018-11-23 11:51:59,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {2085#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#false} is VALID [2018-11-23 11:51:59,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2085#false} is VALID [2018-11-23 11:51:59,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {2085#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2085#false} is VALID [2018-11-23 11:51:59,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:59,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {2085#false} ~i~0 := 0; {2085#false} is VALID [2018-11-23 11:51:59,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2085#false} is VALID [2018-11-23 11:51:59,203 INFO L273 TraceCheckUtils]: 35: Hoare triple {2085#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2085#false} is VALID [2018-11-23 11:51:59,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2085#false} is VALID [2018-11-23 11:51:59,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {2085#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2085#false} is VALID [2018-11-23 11:51:59,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {2085#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2085#false} is VALID [2018-11-23 11:51:59,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {2085#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2085#false} is VALID [2018-11-23 11:51:59,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {2085#false} assume !(~i~0 < 100000); {2085#false} is VALID [2018-11-23 11:51:59,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {2085#false} havoc ~x~0;~x~0 := 0; {2085#false} is VALID [2018-11-23 11:51:59,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {2085#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2085#false} is VALID [2018-11-23 11:51:59,205 INFO L256 TraceCheckUtils]: 43: Hoare triple {2085#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2085#false} is VALID [2018-11-23 11:51:59,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {2085#false} ~cond := #in~cond; {2085#false} is VALID [2018-11-23 11:51:59,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {2085#false} assume 0 == ~cond; {2085#false} is VALID [2018-11-23 11:51:59,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {2085#false} assume !false; {2085#false} is VALID [2018-11-23 11:51:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-23 11:51:59,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 11:51:59,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-23 11:51:59,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:59,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:51:59,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:59,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:59,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:59,335 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2018-11-23 11:52:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,093 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-23 11:52:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:52:00,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-23 11:52:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 11:52:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 95 transitions. [2018-11-23 11:52:00,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 95 transitions. [2018-11-23 11:52:00,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:00,232 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:52:00,233 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:52:00,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:52:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-11-23 11:52:00,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 60 states. [2018-11-23 11:52:00,259 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 60 states. [2018-11-23 11:52:00,260 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 60 states. [2018-11-23 11:52:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,262 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 11:52:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:52:00,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,263 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 64 states. [2018-11-23 11:52:00,263 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 64 states. [2018-11-23 11:52:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,265 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-23 11:52:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-23 11:52:00,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:52:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-23 11:52:00,268 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2018-11-23 11:52:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,269 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-23 11:52:00,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 11:52:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:52:00,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,270 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-11-23 11:52:00,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1609757718, now seen corresponding path program 6 times [2018-11-23 11:52:00,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {2596#true} call ULTIMATE.init(); {2596#true} is VALID [2018-11-23 11:52:00,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {2596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2596#true} is VALID [2018-11-23 11:52:00,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-23 11:52:00,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2596#true} {2596#true} #91#return; {2596#true} is VALID [2018-11-23 11:52:00,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {2596#true} call #t~ret12 := main(); {2596#true} is VALID [2018-11-23 11:52:00,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {2596#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);havoc ~a~0;~a~0 := 0; {2598#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {2598#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2598#(= main_~a~0 0)} is VALID [2018-11-23 11:52:00,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {2598#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2599#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {2599#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2599#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:00,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {2599#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2600#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {2600#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2600#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:00,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {2600#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2601#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {2601#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2601#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:00,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {2601#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2602#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {2602#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2602#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:00,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {2602#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2603#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {2603#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2603#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:00,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {2603#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2604#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:00,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {2604#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2597#false} is VALID [2018-11-23 11:52:00,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {2597#false} havoc ~i~0;~i~0 := 0; {2597#false} is VALID [2018-11-23 11:52:00,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {2597#false} 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; {2597#false} is VALID [2018-11-23 11:52:00,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {2597#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2597#false} is VALID [2018-11-23 11:52:00,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {2597#false} 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; {2597#false} is VALID [2018-11-23 11:52:00,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {2597#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2597#false} is VALID [2018-11-23 11:52:00,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {2597#false} 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; {2597#false} is VALID [2018-11-23 11:52:00,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {2597#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2597#false} is VALID [2018-11-23 11:52:00,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {2597#false} 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; {2597#false} is VALID [2018-11-23 11:52:00,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {2597#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2597#false} is VALID [2018-11-23 11:52:00,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:52:00,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {2597#false} ~i~0 := 0; {2597#false} is VALID [2018-11-23 11:52:00,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2597#false} is VALID [2018-11-23 11:52:00,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {2597#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2597#false} is VALID [2018-11-23 11:52:00,555 INFO L273 TraceCheckUtils]: 32: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2597#false} is VALID [2018-11-23 11:52:00,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {2597#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2597#false} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 34: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2597#false} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 35: Hoare triple {2597#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2597#false} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2597#false} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {2597#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2597#false} is VALID [2018-11-23 11:52:00,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {2597#false} ~i~0 := 0; {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 42: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 43: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:00,557 INFO L273 TraceCheckUtils]: 45: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 46: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {2597#false} havoc ~x~0;~x~0 := 0; {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 50: Hoare triple {2597#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L256 TraceCheckUtils]: 51: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2597#false} is VALID [2018-11-23 11:52:00,558 INFO L273 TraceCheckUtils]: 52: Hoare triple {2597#false} ~cond := #in~cond; {2597#false} is VALID [2018-11-23 11:52:00,559 INFO L273 TraceCheckUtils]: 53: Hoare triple {2597#false} assume 0 == ~cond; {2597#false} is VALID [2018-11-23 11:52:00,559 INFO L273 TraceCheckUtils]: 54: Hoare triple {2597#false} assume !false; {2597#false} is VALID [2018-11-23 11:52:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 11:52:00,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,561 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,571 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:00,893 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:52:00,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:01,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {2596#true} call ULTIMATE.init(); {2596#true} is VALID [2018-11-23 11:52:01,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {2596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2596#true} is VALID [2018-11-23 11:52:01,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {2596#true} assume true; {2596#true} is VALID [2018-11-23 11:52:01,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2596#true} {2596#true} #91#return; {2596#true} is VALID [2018-11-23 11:52:01,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {2596#true} call #t~ret12 := main(); {2596#true} is VALID [2018-11-23 11:52:01,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {2596#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);havoc ~a~0;~a~0 := 0; {2596#true} is VALID [2018-11-23 11:52:01,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {2596#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2596#true} is VALID [2018-11-23 11:52:01,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:52:01,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {2596#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2596#true} is VALID [2018-11-23 11:52:01,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:52:01,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {2596#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {2596#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {2596#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {2596#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {2596#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {2596#true} is VALID [2018-11-23 11:52:01,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {2596#true} assume !(~a~0 < 100000); {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {2596#true} havoc ~i~0;~i~0 := 0; {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {2596#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {2596#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:52:01,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {2596#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2596#true} is VALID [2018-11-23 11:52:01,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {2596#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; {2596#true} is VALID [2018-11-23 11:52:01,060 INFO L273 TraceCheckUtils]: 27: Hoare triple {2596#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2596#true} is VALID [2018-11-23 11:52:01,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {2596#true} assume !(~i~0 < 100000); {2596#true} is VALID [2018-11-23 11:52:01,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {2596#true} ~i~0 := 0; {2695#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {2695#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2695#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:01,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {2695#(<= main_~i~0 0)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2702#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {2702#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2702#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:01,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {2702#(<= main_~i~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2709#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {2709#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2709#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:01,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {2709#(<= main_~i~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2716#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {2716#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {2716#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:01,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {2716#(<= main_~i~0 3)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2723#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:01,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {2723#(<= main_~i~0 4)} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:52:01,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {2597#false} ~i~0 := 0; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 44: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 45: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 46: Hoare triple {2597#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {2597#false} is VALID [2018-11-23 11:52:01,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {2597#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {2597#false} assume !(~i~0 < 100000); {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {2597#false} havoc ~x~0;~x~0 := 0; {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {2597#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L256 TraceCheckUtils]: 51: Hoare triple {2597#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L273 TraceCheckUtils]: 52: Hoare triple {2597#false} ~cond := #in~cond; {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L273 TraceCheckUtils]: 53: Hoare triple {2597#false} assume 0 == ~cond; {2597#false} is VALID [2018-11-23 11:52:01,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {2597#false} assume !false; {2597#false} is VALID [2018-11-23 11:52:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-23 11:52:01,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:01,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 11:52:01,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-23 11:52:01,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:01,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:01,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:01,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:01,159 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 14 states. [2018-11-23 11:52:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,045 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-23 11:52:02,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:02,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-23 11:52:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2018-11-23 11:52:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2018-11-23 11:52:02,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 103 transitions. [2018-11-23 11:52:02,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,226 INFO L225 Difference]: With dead ends: 113 [2018-11-23 11:52:02,226 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:52:02,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:52:02,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-23 11:52:02,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:02,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 68 states. [2018-11-23 11:52:02,267 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 68 states. [2018-11-23 11:52:02,267 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 68 states. [2018-11-23 11:52:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,269 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:52:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:52:02,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,270 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 72 states. [2018-11-23 11:52:02,270 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 72 states. [2018-11-23 11:52:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,272 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:52:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:52:02,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:02,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 11:52:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 11:52:02,276 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 55 [2018-11-23 11:52:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:02,276 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 11:52:02,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 11:52:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:52:02,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:02,277 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 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] [2018-11-23 11:52:02,277 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:02,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash 688370146, now seen corresponding path program 7 times [2018-11-23 11:52:02,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3183#true} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {3183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3183#true} is VALID [2018-11-23 11:52:02,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-23 11:52:02,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #91#return; {3183#true} is VALID [2018-11-23 11:52:02,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret12 := main(); {3183#true} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {3183#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);havoc ~a~0;~a~0 := 0; {3185#(= main_~a~0 0)} is VALID [2018-11-23 11:52:02,470 INFO L273 TraceCheckUtils]: 6: Hoare triple {3185#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3185#(= main_~a~0 0)} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {3185#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {3186#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {3186#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {3187#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {3188#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,477 INFO L273 TraceCheckUtils]: 18: Hoare triple {3191#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {3191#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:02,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,479 INFO L273 TraceCheckUtils]: 21: Hoare triple {3184#false} havoc ~i~0;~i~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 37: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 42: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,483 INFO L273 TraceCheckUtils]: 48: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 49: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 50: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 51: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 52: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L273 TraceCheckUtils]: 56: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L273 TraceCheckUtils]: 57: Hoare triple {3184#false} havoc ~x~0;~x~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {3184#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L256 TraceCheckUtils]: 59: Hoare triple {3184#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {3184#false} ~cond := #in~cond; {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {3184#false} assume 0 == ~cond; {3184#false} is VALID [2018-11-23 11:52:02,485 INFO L273 TraceCheckUtils]: 62: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2018-11-23 11:52:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:52:02,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:02,488 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,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:02,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3183#true} is VALID [2018-11-23 11:52:02,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {3183#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3183#true} is VALID [2018-11-23 11:52:02,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2018-11-23 11:52:02,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #91#return; {3183#true} is VALID [2018-11-23 11:52:02,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret12 := main(); {3183#true} is VALID [2018-11-23 11:52:02,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {3183#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);havoc ~a~0;~a~0 := 0; {3211#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:02,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {3211#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3211#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:02,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {3211#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {3186#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3186#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:02,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {3186#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {3187#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3187#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:02,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {3187#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,705 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3188#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:02,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {3188#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3189#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:02,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3190#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:02,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {3191#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3191#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:02,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {3191#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:02,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {3192#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {3184#false} havoc ~i~0;~i~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {3184#false} 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; {3184#false} is VALID [2018-11-23 11:52:02,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {3184#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3184#false} is VALID [2018-11-23 11:52:02,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {3184#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {3184#false} ~i~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 46: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 54: Hoare triple {3184#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {3184#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {3184#false} assume !(~i~0 < 100000); {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {3184#false} havoc ~x~0;~x~0 := 0; {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {3184#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L256 TraceCheckUtils]: 59: Hoare triple {3184#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {3184#false} ~cond := #in~cond; {3184#false} is VALID [2018-11-23 11:52:02,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {3184#false} assume 0 == ~cond; {3184#false} is VALID [2018-11-23 11:52:02,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2018-11-23 11:52:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:52:02,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:02,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:52:02,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-23 11:52:02,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:02,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:52:02,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:02,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:52:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:52:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:52:02,781 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2018-11-23 11:52:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,202 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-11-23 11:52:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:52:03,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-23 11:52:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 11:52:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:52:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 11:52:03,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-23 11:52:03,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:03,378 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:52:03,378 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 11:52:03,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 11:52:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 11:52:03,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:03,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:03,410 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:03,410 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 11:52:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,412 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 11:52:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 11:52:03,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,412 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 11:52:03,413 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 11:52:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,414 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 11:52:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 11:52:03,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:03,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:03,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:03,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:52:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-23 11:52:03,417 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 63 [2018-11-23 11:52:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:03,417 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-23 11:52:03,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:52:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 11:52:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 11:52:03,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:03,418 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 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] [2018-11-23 11:52:03,418 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:03,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash 187010304, now seen corresponding path program 8 times [2018-11-23 11:52:03,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:03,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:03,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {3801#true} call ULTIMATE.init(); {3801#true} is VALID [2018-11-23 11:52:04,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {3801#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3801#true} is VALID [2018-11-23 11:52:04,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {3801#true} assume true; {3801#true} is VALID [2018-11-23 11:52:04,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3801#true} {3801#true} #91#return; {3801#true} is VALID [2018-11-23 11:52:04,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {3801#true} call #t~ret12 := main(); {3801#true} is VALID [2018-11-23 11:52:04,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {3801#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);havoc ~a~0;~a~0 := 0; {3803#(= main_~a~0 0)} is VALID [2018-11-23 11:52:04,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {3803#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3803#(= main_~a~0 0)} is VALID [2018-11-23 11:52:04,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {3803#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {3804#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {3804#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {3805#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {3805#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {3806#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {3806#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,288 INFO L273 TraceCheckUtils]: 14: Hoare triple {3807#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {3807#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {3808#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {3808#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {3809#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {3809#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,293 INFO L273 TraceCheckUtils]: 20: Hoare triple {3810#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3811#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {3811#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {3802#false} havoc ~i~0;~i~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,296 INFO L273 TraceCheckUtils]: 28: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,296 INFO L273 TraceCheckUtils]: 29: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,297 INFO L273 TraceCheckUtils]: 33: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,298 INFO L273 TraceCheckUtils]: 37: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,300 INFO L273 TraceCheckUtils]: 42: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,300 INFO L273 TraceCheckUtils]: 44: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,300 INFO L273 TraceCheckUtils]: 45: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,300 INFO L273 TraceCheckUtils]: 46: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 48: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 49: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 51: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 52: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,301 INFO L273 TraceCheckUtils]: 54: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,302 INFO L273 TraceCheckUtils]: 55: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,302 INFO L273 TraceCheckUtils]: 56: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {3802#false} havoc ~x~0;~x~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,303 INFO L273 TraceCheckUtils]: 60: Hoare triple {3802#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3802#false} is VALID [2018-11-23 11:52:04,303 INFO L256 TraceCheckUtils]: 61: Hoare triple {3802#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3802#false} is VALID [2018-11-23 11:52:04,303 INFO L273 TraceCheckUtils]: 62: Hoare triple {3802#false} ~cond := #in~cond; {3802#false} is VALID [2018-11-23 11:52:04,303 INFO L273 TraceCheckUtils]: 63: Hoare triple {3802#false} assume 0 == ~cond; {3802#false} is VALID [2018-11-23 11:52:04,304 INFO L273 TraceCheckUtils]: 64: Hoare triple {3802#false} assume !false; {3802#false} is VALID [2018-11-23 11:52:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:52:04,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:04,308 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:04,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:04,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:04,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:04,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:04,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {3801#true} call ULTIMATE.init(); {3801#true} is VALID [2018-11-23 11:52:04,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {3801#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3801#true} is VALID [2018-11-23 11:52:04,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {3801#true} assume true; {3801#true} is VALID [2018-11-23 11:52:04,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3801#true} {3801#true} #91#return; {3801#true} is VALID [2018-11-23 11:52:04,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {3801#true} call #t~ret12 := main(); {3801#true} is VALID [2018-11-23 11:52:04,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {3801#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);havoc ~a~0;~a~0 := 0; {3830#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:04,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {3830#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3830#(<= main_~a~0 0)} is VALID [2018-11-23 11:52:04,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {3830#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {3804#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3804#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:04,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {3804#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {3805#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3805#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:04,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {3805#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {3806#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3806#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:04,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {3806#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {3807#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3807#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:04,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {3807#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {3808#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3808#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:04,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {3808#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,518 INFO L273 TraceCheckUtils]: 18: Hoare triple {3809#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3809#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:04,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {3809#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {3810#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {3810#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:04,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {3810#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {3811#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:04,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {3811#(<= main_~a~0 8)} assume !(~a~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {3802#false} havoc ~i~0;~i~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,522 INFO L273 TraceCheckUtils]: 25: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {3802#false} 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; {3802#false} is VALID [2018-11-23 11:52:04,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {3802#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3802#false} is VALID [2018-11-23 11:52:04,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,526 INFO L273 TraceCheckUtils]: 43: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {3802#false} is VALID [2018-11-23 11:52:04,526 INFO L273 TraceCheckUtils]: 45: Hoare triple {3802#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {3802#false} is VALID [2018-11-23 11:52:04,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,527 INFO L273 TraceCheckUtils]: 47: Hoare triple {3802#false} ~i~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,527 INFO L273 TraceCheckUtils]: 49: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,527 INFO L273 TraceCheckUtils]: 50: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,528 INFO L273 TraceCheckUtils]: 51: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,528 INFO L273 TraceCheckUtils]: 52: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,528 INFO L273 TraceCheckUtils]: 53: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,528 INFO L273 TraceCheckUtils]: 54: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,528 INFO L273 TraceCheckUtils]: 55: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,529 INFO L273 TraceCheckUtils]: 56: Hoare triple {3802#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {3802#false} is VALID [2018-11-23 11:52:04,529 INFO L273 TraceCheckUtils]: 57: Hoare triple {3802#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {3802#false} is VALID [2018-11-23 11:52:04,529 INFO L273 TraceCheckUtils]: 58: Hoare triple {3802#false} assume !(~i~0 < 100000); {3802#false} is VALID [2018-11-23 11:52:04,529 INFO L273 TraceCheckUtils]: 59: Hoare triple {3802#false} havoc ~x~0;~x~0 := 0; {3802#false} is VALID [2018-11-23 11:52:04,530 INFO L273 TraceCheckUtils]: 60: Hoare triple {3802#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {3802#false} is VALID [2018-11-23 11:52:04,530 INFO L256 TraceCheckUtils]: 61: Hoare triple {3802#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {3802#false} is VALID [2018-11-23 11:52:04,530 INFO L273 TraceCheckUtils]: 62: Hoare triple {3802#false} ~cond := #in~cond; {3802#false} is VALID [2018-11-23 11:52:04,530 INFO L273 TraceCheckUtils]: 63: Hoare triple {3802#false} assume 0 == ~cond; {3802#false} is VALID [2018-11-23 11:52:04,530 INFO L273 TraceCheckUtils]: 64: Hoare triple {3802#false} assume !false; {3802#false} is VALID [2018-11-23 11:52:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:52:04,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:04,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:52:04,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-23 11:52:04,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:04,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:52:04,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:04,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:52:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:52:04,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:04,699 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2018-11-23 11:52:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,009 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-11-23 11:52:05,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:52:05,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-23 11:52:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:52:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:52:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 11:52:05,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 11:52:05,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:05,109 INFO L225 Difference]: With dead ends: 120 [2018-11-23 11:52:05,109 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:52:05,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:52:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:52:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 11:52:05,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:05,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 11:52:05,141 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 11:52:05,141 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 11:52:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,143 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 11:52:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 11:52:05,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:05,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:05,144 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 11:52:05,144 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 11:52:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,145 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 11:52:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 11:52:05,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:05,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:05,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:05,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:52:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-11-23 11:52:05,148 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 65 [2018-11-23 11:52:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:05,148 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-11-23 11:52:05,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:52:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:52:05,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:05,149 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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] [2018-11-23 11:52:05,150 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:05,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -583460706, now seen corresponding path program 9 times [2018-11-23 11:52:05,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:05,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {4436#true} call ULTIMATE.init(); {4436#true} is VALID [2018-11-23 11:52:05,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {4436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4436#true} is VALID [2018-11-23 11:52:05,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {4436#true} assume true; {4436#true} is VALID [2018-11-23 11:52:05,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4436#true} {4436#true} #91#return; {4436#true} is VALID [2018-11-23 11:52:05,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {4436#true} call #t~ret12 := main(); {4436#true} is VALID [2018-11-23 11:52:05,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {4436#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);havoc ~a~0;~a~0 := 0; {4438#(= main_~a~0 0)} is VALID [2018-11-23 11:52:05,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {4438#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4438#(= main_~a~0 0)} is VALID [2018-11-23 11:52:05,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {4438#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4439#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:05,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {4439#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4439#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:05,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {4439#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4440#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:05,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {4440#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4440#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:05,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {4440#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4441#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:05,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {4441#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4441#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:05,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {4441#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4442#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:05,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {4442#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4442#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:05,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {4442#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4443#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:05,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {4443#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4443#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:05,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {4443#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4444#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:05,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {4444#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4444#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:05,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {4444#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4445#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:05,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {4445#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4445#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:05,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {4445#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4446#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:05,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {4446#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4446#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:05,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {4446#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4447#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:05,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {4447#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4437#false} is VALID [2018-11-23 11:52:05,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {4437#false} havoc ~i~0;~i~0 := 0; {4437#false} is VALID [2018-11-23 11:52:05,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {4437#false} 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; {4437#false} is VALID [2018-11-23 11:52:05,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {4437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#false} is VALID [2018-11-23 11:52:05,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {4437#false} 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; {4437#false} is VALID [2018-11-23 11:52:05,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {4437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#false} is VALID [2018-11-23 11:52:05,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {4437#false} 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; {4437#false} is VALID [2018-11-23 11:52:05,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {4437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#false} is VALID [2018-11-23 11:52:05,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {4437#false} 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; {4437#false} is VALID [2018-11-23 11:52:05,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {4437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#false} is VALID [2018-11-23 11:52:05,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {4437#false} 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; {4437#false} is VALID [2018-11-23 11:52:05,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {4437#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#false} is VALID [2018-11-23 11:52:05,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {4437#false} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:52:05,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {4437#false} ~i~0 := 0; {4437#false} is VALID [2018-11-23 11:52:05,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4437#false} is VALID [2018-11-23 11:52:05,574 INFO L273 TraceCheckUtils]: 39: Hoare triple {4437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4437#false} is VALID [2018-11-23 11:52:05,574 INFO L273 TraceCheckUtils]: 40: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4437#false} is VALID [2018-11-23 11:52:05,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {4437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4437#false} is VALID [2018-11-23 11:52:05,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4437#false} is VALID [2018-11-23 11:52:05,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {4437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4437#false} is VALID [2018-11-23 11:52:05,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4437#false} is VALID [2018-11-23 11:52:05,575 INFO L273 TraceCheckUtils]: 45: Hoare triple {4437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4437#false} is VALID [2018-11-23 11:52:05,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4437#false} is VALID [2018-11-23 11:52:05,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {4437#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4437#false} is VALID [2018-11-23 11:52:05,576 INFO L273 TraceCheckUtils]: 48: Hoare triple {4437#false} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:52:05,576 INFO L273 TraceCheckUtils]: 49: Hoare triple {4437#false} ~i~0 := 0; {4437#false} is VALID [2018-11-23 11:52:05,576 INFO L273 TraceCheckUtils]: 50: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4437#false} is VALID [2018-11-23 11:52:05,576 INFO L273 TraceCheckUtils]: 51: Hoare triple {4437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4437#false} is VALID [2018-11-23 11:52:05,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 53: Hoare triple {4437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 54: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 55: Hoare triple {4437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 56: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 57: Hoare triple {4437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 58: Hoare triple {4437#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4437#false} is VALID [2018-11-23 11:52:05,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {4437#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4437#false} is VALID [2018-11-23 11:52:05,578 INFO L273 TraceCheckUtils]: 60: Hoare triple {4437#false} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:52:05,578 INFO L273 TraceCheckUtils]: 61: Hoare triple {4437#false} havoc ~x~0;~x~0 := 0; {4437#false} is VALID [2018-11-23 11:52:05,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {4437#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4437#false} is VALID [2018-11-23 11:52:05,578 INFO L256 TraceCheckUtils]: 63: Hoare triple {4437#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4437#false} is VALID [2018-11-23 11:52:05,578 INFO L273 TraceCheckUtils]: 64: Hoare triple {4437#false} ~cond := #in~cond; {4437#false} is VALID [2018-11-23 11:52:05,578 INFO L273 TraceCheckUtils]: 65: Hoare triple {4437#false} assume 0 == ~cond; {4437#false} is VALID [2018-11-23 11:52:05,579 INFO L273 TraceCheckUtils]: 66: Hoare triple {4437#false} assume !false; {4437#false} is VALID [2018-11-23 11:52:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 11:52:05,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:05,583 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,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:05,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:52:05,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:06,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {4436#true} call ULTIMATE.init(); {4436#true} is VALID [2018-11-23 11:52:06,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {4436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4436#true} is VALID [2018-11-23 11:52:06,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {4436#true} assume true; {4436#true} is VALID [2018-11-23 11:52:06,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4436#true} {4436#true} #91#return; {4436#true} is VALID [2018-11-23 11:52:06,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {4436#true} call #t~ret12 := main(); {4436#true} is VALID [2018-11-23 11:52:06,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {4436#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);havoc ~a~0;~a~0 := 0; {4436#true} is VALID [2018-11-23 11:52:06,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {4436#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {4436#true} is VALID [2018-11-23 11:52:06,096 INFO L273 TraceCheckUtils]: 23: Hoare triple {4436#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {4436#true} assume !(~a~0 < 100000); {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {4436#true} havoc ~i~0;~i~0 := 0; {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 27: Hoare triple {4436#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {4436#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4436#true} is VALID [2018-11-23 11:52:06,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:52:06,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {4436#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4436#true} is VALID [2018-11-23 11:52:06,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:52:06,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {4436#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4436#true} is VALID [2018-11-23 11:52:06,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {4436#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; {4436#true} is VALID [2018-11-23 11:52:06,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {4436#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4436#true} is VALID [2018-11-23 11:52:06,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {4436#true} assume !(~i~0 < 100000); {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {4436#true} ~i~0 := 0; {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {4436#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 39: Hoare triple {4436#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {4436#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {4436#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 42: Hoare triple {4436#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4436#true} is VALID [2018-11-23 11:52:06,099 INFO L273 TraceCheckUtils]: 43: Hoare triple {4436#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4436#true} is VALID [2018-11-23 11:52:06,100 INFO L273 TraceCheckUtils]: 44: Hoare triple {4436#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4436#true} is VALID [2018-11-23 11:52:06,100 INFO L273 TraceCheckUtils]: 45: Hoare triple {4436#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4436#true} is VALID [2018-11-23 11:52:06,100 INFO L273 TraceCheckUtils]: 46: Hoare triple {4436#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {4436#true} is VALID [2018-11-23 11:52:06,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {4436#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {4436#true} is VALID [2018-11-23 11:52:06,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {4436#true} assume !(~i~0 < 100000); {4436#true} is VALID [2018-11-23 11:52:06,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {4436#true} ~i~0 := 0; {4598#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:06,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {4598#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4598#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:06,102 INFO L273 TraceCheckUtils]: 51: Hoare triple {4598#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4605#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:06,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {4605#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4605#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:06,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {4605#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4612#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,103 INFO L273 TraceCheckUtils]: 54: Hoare triple {4612#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4612#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {4612#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4619#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {4619#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4619#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,106 INFO L273 TraceCheckUtils]: 57: Hoare triple {4619#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4626#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,107 INFO L273 TraceCheckUtils]: 58: Hoare triple {4626#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {4626#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,107 INFO L273 TraceCheckUtils]: 59: Hoare triple {4626#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {4633#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:06,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {4633#(<= main_~i~0 5)} assume !(~i~0 < 100000); {4437#false} is VALID [2018-11-23 11:52:06,109 INFO L273 TraceCheckUtils]: 61: Hoare triple {4437#false} havoc ~x~0;~x~0 := 0; {4437#false} is VALID [2018-11-23 11:52:06,109 INFO L273 TraceCheckUtils]: 62: Hoare triple {4437#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {4437#false} is VALID [2018-11-23 11:52:06,109 INFO L256 TraceCheckUtils]: 63: Hoare triple {4437#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {4437#false} is VALID [2018-11-23 11:52:06,109 INFO L273 TraceCheckUtils]: 64: Hoare triple {4437#false} ~cond := #in~cond; {4437#false} is VALID [2018-11-23 11:52:06,110 INFO L273 TraceCheckUtils]: 65: Hoare triple {4437#false} assume 0 == ~cond; {4437#false} is VALID [2018-11-23 11:52:06,110 INFO L273 TraceCheckUtils]: 66: Hoare triple {4437#false} assume !false; {4437#false} is VALID [2018-11-23 11:52:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-23 11:52:06,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:06,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-11-23 11:52:06,139 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-11-23 11:52:06,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:06,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:06,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:06,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:06,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:06,216 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 18 states. [2018-11-23 11:52:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,999 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-11-23 11:52:06,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:06,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-11-23 11:52:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2018-11-23 11:52:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2018-11-23 11:52:07,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 115 transitions. [2018-11-23 11:52:07,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:07,708 INFO L225 Difference]: With dead ends: 131 [2018-11-23 11:52:07,708 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 11:52:07,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 11:52:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-11-23 11:52:08,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:08,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2018-11-23 11:52:08,230 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2018-11-23 11:52:08,231 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2018-11-23 11:52:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,233 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 11:52:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:52:08,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:08,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:08,233 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2018-11-23 11:52:08,233 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2018-11-23 11:52:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:08,235 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 11:52:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-11-23 11:52:08,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:08,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:08,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:08,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:52:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 11:52:08,238 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 67 [2018-11-23 11:52:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:08,238 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 11:52:08,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 11:52:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:52:08,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:08,239 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 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] [2018-11-23 11:52:08,240 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:08,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash -443077994, now seen corresponding path program 10 times [2018-11-23 11:52:08,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:08,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-23 11:52:08,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {5132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5132#true} is VALID [2018-11-23 11:52:08,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-23 11:52:08,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #91#return; {5132#true} is VALID [2018-11-23 11:52:08,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret12 := main(); {5132#true} is VALID [2018-11-23 11:52:08,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {5132#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);havoc ~a~0;~a~0 := 0; {5134#(= main_~a~0 0)} is VALID [2018-11-23 11:52:08,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {5134#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5134#(= main_~a~0 0)} is VALID [2018-11-23 11:52:08,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5135#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:08,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {5135#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5135#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:08,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {5135#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5136#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:08,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {5136#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5136#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:08,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {5136#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5137#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:08,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {5137#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5137#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:08,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {5137#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5138#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:08,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {5138#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5138#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:08,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {5138#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5139#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:08,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {5139#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5139#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:08,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {5139#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5140#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:08,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {5140#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5140#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:08,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {5140#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5141#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:08,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {5141#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5141#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:08,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {5141#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5142#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:08,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {5142#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5142#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:08,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {5142#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5143#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:08,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {5143#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5143#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:08,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {5143#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5144#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:08,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {5144#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5133#false} is VALID [2018-11-23 11:52:08,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {5133#false} havoc ~i~0;~i~0 := 0; {5133#false} is VALID [2018-11-23 11:52:08,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {5133#false} 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; {5133#false} is VALID [2018-11-23 11:52:08,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {5133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#false} is VALID [2018-11-23 11:52:08,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {5133#false} 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; {5133#false} is VALID [2018-11-23 11:52:08,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {5133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#false} is VALID [2018-11-23 11:52:08,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {5133#false} 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; {5133#false} is VALID [2018-11-23 11:52:08,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {5133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#false} is VALID [2018-11-23 11:52:08,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {5133#false} 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; {5133#false} is VALID [2018-11-23 11:52:08,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {5133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#false} is VALID [2018-11-23 11:52:08,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {5133#false} 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; {5133#false} is VALID [2018-11-23 11:52:08,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {5133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#false} is VALID [2018-11-23 11:52:08,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {5133#false} 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; {5133#false} is VALID [2018-11-23 11:52:08,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {5133#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#false} is VALID [2018-11-23 11:52:08,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {5133#false} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:52:08,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {5133#false} ~i~0 := 0; {5133#false} is VALID [2018-11-23 11:52:08,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5133#false} is VALID [2018-11-23 11:52:08,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {5133#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5133#false} is VALID [2018-11-23 11:52:08,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5133#false} is VALID [2018-11-23 11:52:08,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {5133#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5133#false} is VALID [2018-11-23 11:52:08,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5133#false} is VALID [2018-11-23 11:52:08,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {5133#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {5133#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {5133#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {5133#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {5133#false} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:52:08,966 INFO L273 TraceCheckUtils]: 55: Hoare triple {5133#false} ~i~0 := 0; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {5133#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 59: Hoare triple {5133#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 61: Hoare triple {5133#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 62: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 63: Hoare triple {5133#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5133#false} is VALID [2018-11-23 11:52:08,967 INFO L273 TraceCheckUtils]: 64: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 65: Hoare triple {5133#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 66: Hoare triple {5133#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 67: Hoare triple {5133#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {5133#false} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {5133#false} havoc ~x~0;~x~0 := 0; {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 70: Hoare triple {5133#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L256 TraceCheckUtils]: 71: Hoare triple {5133#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5133#false} is VALID [2018-11-23 11:52:08,968 INFO L273 TraceCheckUtils]: 72: Hoare triple {5133#false} ~cond := #in~cond; {5133#false} is VALID [2018-11-23 11:52:08,969 INFO L273 TraceCheckUtils]: 73: Hoare triple {5133#false} assume 0 == ~cond; {5133#false} is VALID [2018-11-23 11:52:08,969 INFO L273 TraceCheckUtils]: 74: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-23 11:52:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 11:52:08,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:08,972 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:08,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:09,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:09,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:09,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:09,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-23 11:52:09,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {5132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5132#true} is VALID [2018-11-23 11:52:09,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-23 11:52:09,310 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #91#return; {5132#true} is VALID [2018-11-23 11:52:09,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret12 := main(); {5132#true} is VALID [2018-11-23 11:52:09,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {5132#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);havoc ~a~0;~a~0 := 0; {5132#true} is VALID [2018-11-23 11:52:09,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {5132#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5132#true} is VALID [2018-11-23 11:52:09,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {5132#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {5132#true} assume !(~a~0 < 100000); {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {5132#true} havoc ~i~0;~i~0 := 0; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {5132#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {5132#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {5132#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#true} is VALID [2018-11-23 11:52:09,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {5132#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {5132#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {5132#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; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 39: Hoare triple {5132#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {5132#true} assume !(~i~0 < 100000); {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 41: Hoare triple {5132#true} ~i~0 := 0; {5132#true} is VALID [2018-11-23 11:52:09,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {5132#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {5132#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {5132#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 45: Hoare triple {5132#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {5132#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {5132#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {5132#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {5132#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5132#true} is VALID [2018-11-23 11:52:09,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {5132#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5132#true} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {5132#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5132#true} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {5132#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5132#true} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {5132#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5132#true} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 54: Hoare triple {5132#true} assume !(~i~0 < 100000); {5132#true} is VALID [2018-11-23 11:52:09,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {5132#true} ~i~0 := 0; {5313#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:09,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {5313#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5313#(<= main_~i~0 0)} is VALID [2018-11-23 11:52:09,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {5313#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5320#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:09,319 INFO L273 TraceCheckUtils]: 58: Hoare triple {5320#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5320#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:09,319 INFO L273 TraceCheckUtils]: 59: Hoare triple {5320#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:09,319 INFO L273 TraceCheckUtils]: 60: Hoare triple {5327#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:09,320 INFO L273 TraceCheckUtils]: 61: Hoare triple {5327#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5334#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:09,321 INFO L273 TraceCheckUtils]: 62: Hoare triple {5334#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5334#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:09,321 INFO L273 TraceCheckUtils]: 63: Hoare triple {5334#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5341#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:09,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {5341#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5341#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:09,323 INFO L273 TraceCheckUtils]: 65: Hoare triple {5341#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5348#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:09,323 INFO L273 TraceCheckUtils]: 66: Hoare triple {5348#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5348#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:09,324 INFO L273 TraceCheckUtils]: 67: Hoare triple {5348#(<= main_~i~0 5)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5355#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {5355#(<= main_~i~0 6)} assume !(~i~0 < 100000); {5133#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {5133#false} havoc ~x~0;~x~0 := 0; {5133#false} is VALID [2018-11-23 11:52:09,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {5133#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5133#false} is VALID [2018-11-23 11:52:09,325 INFO L256 TraceCheckUtils]: 71: Hoare triple {5133#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5133#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {5133#false} ~cond := #in~cond; {5133#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {5133#false} assume 0 == ~cond; {5133#false} is VALID [2018-11-23 11:52:09,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-23 11:52:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-23 11:52:09,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:09,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2018-11-23 11:52:09,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-23 11:52:09,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:09,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:09,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:09,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:09,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:09,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:09,427 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 20 states. [2018-11-23 11:52:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:10,320 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2018-11-23 11:52:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:10,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-23 11:52:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 123 transitions. [2018-11-23 11:52:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 123 transitions. [2018-11-23 11:52:10,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 123 transitions. [2018-11-23 11:52:10,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:52:10,852 INFO L225 Difference]: With dead ends: 145 [2018-11-23 11:52:10,852 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:52:10,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:52:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-23 11:52:11,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:11,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 88 states. [2018-11-23 11:52:11,006 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 88 states. [2018-11-23 11:52:11,006 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 88 states. [2018-11-23 11:52:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,008 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:52:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:52:11,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:11,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:11,009 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 92 states. [2018-11-23 11:52:11,010 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 92 states. [2018-11-23 11:52:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:11,011 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-11-23 11:52:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-23 11:52:11,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:11,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:11,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:11,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:52:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-23 11:52:11,014 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 75 [2018-11-23 11:52:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:11,015 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-23 11:52:11,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 11:52:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 11:52:11,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:11,016 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 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] [2018-11-23 11:52:11,016 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:11,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1426138254, now seen corresponding path program 11 times [2018-11-23 11:52:11,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:11,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:11,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:11,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:11,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:11,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {5903#true} call ULTIMATE.init(); {5903#true} is VALID [2018-11-23 11:52:11,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {5903#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5903#true} is VALID [2018-11-23 11:52:11,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {5903#true} assume true; {5903#true} is VALID [2018-11-23 11:52:11,642 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5903#true} {5903#true} #91#return; {5903#true} is VALID [2018-11-23 11:52:11,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {5903#true} call #t~ret12 := main(); {5903#true} is VALID [2018-11-23 11:52:11,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {5903#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);havoc ~a~0;~a~0 := 0; {5905#(= main_~a~0 0)} is VALID [2018-11-23 11:52:11,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {5905#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5905#(= main_~a~0 0)} is VALID [2018-11-23 11:52:11,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {5905#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {5906#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:52:11,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {5906#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {5907#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:52:11,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {5907#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {5908#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:52:11,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {5908#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {5909#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:52:11,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {5909#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {5910#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:52:11,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {5910#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {5911#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:52:11,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {5911#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {5912#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:52:11,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {5912#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {5913#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:52:11,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {5913#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {5914#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:52:11,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {5914#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {5915#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:52:11,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {5915#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5916#(<= main_~a~0 11)} is VALID [2018-11-23 11:52:11,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {5916#(<= main_~a~0 11)} assume !(~a~0 < 100000); {5904#false} is VALID [2018-11-23 11:52:11,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {5904#false} havoc ~i~0;~i~0 := 0; {5904#false} is VALID [2018-11-23 11:52:11,657 INFO L273 TraceCheckUtils]: 30: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,657 INFO L273 TraceCheckUtils]: 31: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,658 INFO L273 TraceCheckUtils]: 32: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,659 INFO L273 TraceCheckUtils]: 37: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,659 INFO L273 TraceCheckUtils]: 38: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 43: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 44: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 45: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 47: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 48: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 49: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 52: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 53: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 54: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 55: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 56: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 57: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,661 INFO L273 TraceCheckUtils]: 58: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 59: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 60: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 61: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 62: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 65: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,662 INFO L273 TraceCheckUtils]: 66: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 67: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 68: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 69: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 70: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 71: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 72: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 73: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,663 INFO L273 TraceCheckUtils]: 74: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 75: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 77: Hoare triple {5904#false} havoc ~x~0;~x~0 := 0; {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 78: Hoare triple {5904#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L256 TraceCheckUtils]: 79: Hoare triple {5904#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 80: Hoare triple {5904#false} ~cond := #in~cond; {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 81: Hoare triple {5904#false} assume 0 == ~cond; {5904#false} is VALID [2018-11-23 11:52:11,664 INFO L273 TraceCheckUtils]: 82: Hoare triple {5904#false} assume !false; {5904#false} is VALID [2018-11-23 11:52:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:52:11,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:11,668 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:11,678 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:05,436 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:53:05,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:05,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:05,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {5903#true} call ULTIMATE.init(); {5903#true} is VALID [2018-11-23 11:53:05,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {5903#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5903#true} is VALID [2018-11-23 11:53:05,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {5903#true} assume true; {5903#true} is VALID [2018-11-23 11:53:05,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5903#true} {5903#true} #91#return; {5903#true} is VALID [2018-11-23 11:53:05,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {5903#true} call #t~ret12 := main(); {5903#true} is VALID [2018-11-23 11:53:05,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {5903#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);havoc ~a~0;~a~0 := 0; {5935#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:05,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {5935#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5935#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:05,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {5935#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:05,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {5906#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5906#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:05,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {5906#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:05,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {5907#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5907#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:05,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {5907#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:05,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {5908#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5908#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:05,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {5908#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:05,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {5909#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5909#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:05,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {5909#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:05,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {5910#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5910#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:05,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {5910#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:05,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {5911#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5911#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:05,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {5911#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:05,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {5912#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5912#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:05,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {5912#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:05,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {5913#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5913#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:05,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {5913#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:05,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {5914#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5914#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:05,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {5914#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:05,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {5915#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {5915#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:05,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {5915#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {5916#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:05,647 INFO L273 TraceCheckUtils]: 28: Hoare triple {5916#(<= main_~a~0 11)} assume !(~a~0 < 100000); {5904#false} is VALID [2018-11-23 11:53:05,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {5904#false} havoc ~i~0;~i~0 := 0; {5904#false} is VALID [2018-11-23 11:53:05,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,648 INFO L273 TraceCheckUtils]: 31: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,648 INFO L273 TraceCheckUtils]: 32: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,649 INFO L273 TraceCheckUtils]: 37: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {5904#false} 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; {5904#false} is VALID [2018-11-23 11:53:05,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {5904#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5904#false} is VALID [2018-11-23 11:53:05,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:53:05,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:53:05,651 INFO L273 TraceCheckUtils]: 46: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 53: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 59: Hoare triple {5904#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 60: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:53:05,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {5904#false} ~i~0 := 0; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 66: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 67: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 68: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,654 INFO L273 TraceCheckUtils]: 69: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 73: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 74: Hoare triple {5904#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 75: Hoare triple {5904#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 76: Hoare triple {5904#false} assume !(~i~0 < 100000); {5904#false} is VALID [2018-11-23 11:53:05,655 INFO L273 TraceCheckUtils]: 77: Hoare triple {5904#false} havoc ~x~0;~x~0 := 0; {5904#false} is VALID [2018-11-23 11:53:05,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {5904#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {5904#false} is VALID [2018-11-23 11:53:05,656 INFO L256 TraceCheckUtils]: 79: Hoare triple {5904#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {5904#false} is VALID [2018-11-23 11:53:05,656 INFO L273 TraceCheckUtils]: 80: Hoare triple {5904#false} ~cond := #in~cond; {5904#false} is VALID [2018-11-23 11:53:05,656 INFO L273 TraceCheckUtils]: 81: Hoare triple {5904#false} assume 0 == ~cond; {5904#false} is VALID [2018-11-23 11:53:05,656 INFO L273 TraceCheckUtils]: 82: Hoare triple {5904#false} assume !false; {5904#false} is VALID [2018-11-23 11:53:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:53:05,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:05,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:53:05,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-11-23 11:53:05,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:05,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:53:05,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:05,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:53:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:53:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:53:05,747 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 15 states. [2018-11-23 11:53:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:06,169 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-23 11:53:06,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:53:06,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2018-11-23 11:53:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:53:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2018-11-23 11:53:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:53:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2018-11-23 11:53:06,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 80 transitions. [2018-11-23 11:53:06,760 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:53:06,762 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:53:06,762 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:53:06,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 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:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:53:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-23 11:53:06,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:06,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 90 states. [2018-11-23 11:53:06,798 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 90 states. [2018-11-23 11:53:06,799 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 90 states. [2018-11-23 11:53:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:06,801 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-23 11:53:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-23 11:53:06,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:06,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:06,802 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 91 states. [2018-11-23 11:53:06,802 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 91 states. [2018-11-23 11:53:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:06,803 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-23 11:53:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-23 11:53:06,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:06,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:06,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:06,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:53:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-23 11:53:06,806 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 83 [2018-11-23 11:53:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:06,807 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-23 11:53:06,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:53:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 11:53:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:53:06,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:06,808 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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] [2018-11-23 11:53:06,808 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:06,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:06,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1519404204, now seen corresponding path program 12 times [2018-11-23 11:53:06,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:06,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:07,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {6703#true} call ULTIMATE.init(); {6703#true} is VALID [2018-11-23 11:53:07,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {6703#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6703#true} is VALID [2018-11-23 11:53:07,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {6703#true} assume true; {6703#true} is VALID [2018-11-23 11:53:07,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6703#true} {6703#true} #91#return; {6703#true} is VALID [2018-11-23 11:53:07,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {6703#true} call #t~ret12 := main(); {6703#true} is VALID [2018-11-23 11:53:07,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {6703#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);havoc ~a~0;~a~0 := 0; {6705#(= main_~a~0 0)} is VALID [2018-11-23 11:53:07,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {6705#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6705#(= main_~a~0 0)} is VALID [2018-11-23 11:53:07,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {6705#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6706#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:07,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {6706#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6706#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:07,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {6706#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:07,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {6707#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6707#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:07,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {6707#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:07,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {6708#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6708#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:07,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {6708#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6709#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:07,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {6709#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6709#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:07,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {6709#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6710#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:07,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {6710#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6710#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:07,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {6710#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6711#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:07,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {6711#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6711#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:07,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {6711#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6712#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:07,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {6712#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6712#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:07,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {6712#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6713#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:07,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {6713#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6713#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:07,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {6713#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6714#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:07,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {6714#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6714#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:07,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {6714#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6715#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:07,100 INFO L273 TraceCheckUtils]: 26: Hoare triple {6715#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6715#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:07,101 INFO L273 TraceCheckUtils]: 27: Hoare triple {6715#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6716#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:07,101 INFO L273 TraceCheckUtils]: 28: Hoare triple {6716#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6716#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:07,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {6716#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6717#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:07,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {6717#(<= main_~a~0 12)} assume !(~a~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:07,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {6704#false} havoc ~i~0;~i~0 := 0; {6704#false} is VALID [2018-11-23 11:53:07,103 INFO L273 TraceCheckUtils]: 32: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,104 INFO L273 TraceCheckUtils]: 35: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,104 INFO L273 TraceCheckUtils]: 37: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,105 INFO L273 TraceCheckUtils]: 39: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,106 INFO L273 TraceCheckUtils]: 44: Hoare triple {6704#false} 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; {6704#false} is VALID [2018-11-23 11:53:07,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {6704#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6704#false} is VALID [2018-11-23 11:53:07,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:07,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:53:07,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,107 INFO L273 TraceCheckUtils]: 51: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,107 INFO L273 TraceCheckUtils]: 52: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 53: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 54: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 55: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 57: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 59: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:07,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 62: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 63: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 64: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 65: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 66: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 67: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,109 INFO L273 TraceCheckUtils]: 68: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,110 INFO L273 TraceCheckUtils]: 69: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,110 INFO L273 TraceCheckUtils]: 70: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,110 INFO L273 TraceCheckUtils]: 71: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,110 INFO L273 TraceCheckUtils]: 72: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,110 INFO L273 TraceCheckUtils]: 73: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,110 INFO L273 TraceCheckUtils]: 74: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,111 INFO L273 TraceCheckUtils]: 75: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,111 INFO L273 TraceCheckUtils]: 76: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:07,111 INFO L273 TraceCheckUtils]: 77: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:07,111 INFO L273 TraceCheckUtils]: 78: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:07,111 INFO L273 TraceCheckUtils]: 79: Hoare triple {6704#false} havoc ~x~0;~x~0 := 0; {6704#false} is VALID [2018-11-23 11:53:07,111 INFO L273 TraceCheckUtils]: 80: Hoare triple {6704#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {6704#false} is VALID [2018-11-23 11:53:07,112 INFO L256 TraceCheckUtils]: 81: Hoare triple {6704#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6704#false} is VALID [2018-11-23 11:53:07,112 INFO L273 TraceCheckUtils]: 82: Hoare triple {6704#false} ~cond := #in~cond; {6704#false} is VALID [2018-11-23 11:53:07,112 INFO L273 TraceCheckUtils]: 83: Hoare triple {6704#false} assume 0 == ~cond; {6704#false} is VALID [2018-11-23 11:53:07,112 INFO L273 TraceCheckUtils]: 84: Hoare triple {6704#false} assume !false; {6704#false} is VALID [2018-11-23 11:53:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 11:53:07,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:07,116 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:07,126 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:26,265 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:53:26,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:26,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:26,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {6703#true} call ULTIMATE.init(); {6703#true} is VALID [2018-11-23 11:53:26,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {6703#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6703#true} is VALID [2018-11-23 11:53:26,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {6703#true} assume true; {6703#true} is VALID [2018-11-23 11:53:26,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6703#true} {6703#true} #91#return; {6703#true} is VALID [2018-11-23 11:53:26,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {6703#true} call #t~ret12 := main(); {6703#true} is VALID [2018-11-23 11:53:26,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {6703#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);havoc ~a~0;~a~0 := 0; {6703#true} is VALID [2018-11-23 11:53:26,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,542 INFO L273 TraceCheckUtils]: 25: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {6703#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {6703#true} is VALID [2018-11-23 11:53:26,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {6703#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {6703#true} is VALID [2018-11-23 11:53:26,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {6703#true} assume !(~a~0 < 100000); {6703#true} is VALID [2018-11-23 11:53:26,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {6703#true} havoc ~i~0;~i~0 := 0; {6814#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:26,560 INFO L273 TraceCheckUtils]: 32: Hoare triple {6814#(<= 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; {6814#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:26,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {6814#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6821#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:26,561 INFO L273 TraceCheckUtils]: 34: Hoare triple {6821#(<= 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; {6821#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:26,562 INFO L273 TraceCheckUtils]: 35: Hoare triple {6821#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6828#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:26,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {6828#(<= 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; {6828#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:26,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {6828#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6835#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:26,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {6835#(<= 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; {6835#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:26,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {6835#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6842#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:26,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {6842#(<= 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; {6842#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:26,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {6842#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6849#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:26,568 INFO L273 TraceCheckUtils]: 42: Hoare triple {6849#(<= 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; {6849#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:26,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {6849#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6856#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:26,569 INFO L273 TraceCheckUtils]: 44: Hoare triple {6856#(<= 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; {6856#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:26,570 INFO L273 TraceCheckUtils]: 45: Hoare triple {6856#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6863#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:26,570 INFO L273 TraceCheckUtils]: 46: Hoare triple {6863#(<= main_~i~0 7)} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:26,570 INFO L273 TraceCheckUtils]: 47: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:53:26,570 INFO L273 TraceCheckUtils]: 48: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,570 INFO L273 TraceCheckUtils]: 49: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 50: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 51: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 54: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,572 INFO L273 TraceCheckUtils]: 58: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,572 INFO L273 TraceCheckUtils]: 59: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,572 INFO L273 TraceCheckUtils]: 60: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {6704#false} is VALID [2018-11-23 11:53:26,572 INFO L273 TraceCheckUtils]: 61: Hoare triple {6704#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {6704#false} is VALID [2018-11-23 11:53:26,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:26,572 INFO L273 TraceCheckUtils]: 63: Hoare triple {6704#false} ~i~0 := 0; {6704#false} is VALID [2018-11-23 11:53:26,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,573 INFO L273 TraceCheckUtils]: 65: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,573 INFO L273 TraceCheckUtils]: 66: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,573 INFO L273 TraceCheckUtils]: 67: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,573 INFO L273 TraceCheckUtils]: 68: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 73: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 74: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {6704#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L273 TraceCheckUtils]: 77: Hoare triple {6704#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L273 TraceCheckUtils]: 78: Hoare triple {6704#false} assume !(~i~0 < 100000); {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {6704#false} havoc ~x~0;~x~0 := 0; {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {6704#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L256 TraceCheckUtils]: 81: Hoare triple {6704#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L273 TraceCheckUtils]: 82: Hoare triple {6704#false} ~cond := #in~cond; {6704#false} is VALID [2018-11-23 11:53:26,575 INFO L273 TraceCheckUtils]: 83: Hoare triple {6704#false} assume 0 == ~cond; {6704#false} is VALID [2018-11-23 11:53:26,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {6704#false} assume !false; {6704#false} is VALID [2018-11-23 11:53:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 11:53:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:26,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 11:53:26,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-11-23 11:53:26,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:26,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:53:26,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:26,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:53:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:53:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:53:26,677 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 23 states. [2018-11-23 11:53:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:27,530 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-11-23 11:53:27,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:53:27,531 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-11-23 11:53:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:53:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:53:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:53:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:53:27,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 133 transitions. [2018-11-23 11:53:27,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:27,773 INFO L225 Difference]: With dead ends: 161 [2018-11-23 11:53:27,773 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 11:53:27,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:53:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 11:53:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-23 11:53:27,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:27,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 98 states. [2018-11-23 11:53:27,813 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 98 states. [2018-11-23 11:53:27,813 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 98 states. [2018-11-23 11:53:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:27,815 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-23 11:53:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-23 11:53:27,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:27,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:27,816 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 102 states. [2018-11-23 11:53:27,816 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 102 states. [2018-11-23 11:53:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:27,818 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-23 11:53:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-23 11:53:27,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:27,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:27,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:27,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:53:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-11-23 11:53:27,821 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 85 [2018-11-23 11:53:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:27,821 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-11-23 11:53:27,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:53:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-11-23 11:53:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:53:27,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:27,822 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 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] [2018-11-23 11:53:27,823 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:27,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash -590141276, now seen corresponding path program 13 times [2018-11-23 11:53:27,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:27,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:27,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:27,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:27,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:28,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {7566#true} call ULTIMATE.init(); {7566#true} is VALID [2018-11-23 11:53:28,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {7566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7566#true} is VALID [2018-11-23 11:53:28,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {7566#true} assume true; {7566#true} is VALID [2018-11-23 11:53:28,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7566#true} {7566#true} #91#return; {7566#true} is VALID [2018-11-23 11:53:28,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {7566#true} call #t~ret12 := main(); {7566#true} is VALID [2018-11-23 11:53:28,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {7566#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);havoc ~a~0;~a~0 := 0; {7568#(= main_~a~0 0)} is VALID [2018-11-23 11:53:28,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {7568#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7568#(= main_~a~0 0)} is VALID [2018-11-23 11:53:28,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {7568#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:28,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {7569#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:28,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {7569#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:28,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {7570#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:28,991 INFO L273 TraceCheckUtils]: 11: Hoare triple {7570#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:28,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {7571#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:28,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {7571#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:28,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {7572#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:28,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {7572#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:28,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {7573#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:28,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {7573#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:28,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {7574#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:28,995 INFO L273 TraceCheckUtils]: 19: Hoare triple {7574#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:28,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {7575#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:28,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {7575#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:28,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {7576#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:28,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {7576#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:28,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {7577#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:28,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {7577#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:29,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {7578#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:29,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {7578#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:29,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {7579#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:29,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {7579#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:29,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {7580#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:29,003 INFO L273 TraceCheckUtils]: 31: Hoare triple {7580#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7581#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:29,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {7581#(<= main_~a~0 13)} assume !(~a~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,004 INFO L273 TraceCheckUtils]: 33: Hoare triple {7567#false} havoc ~i~0;~i~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,005 INFO L273 TraceCheckUtils]: 36: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,005 INFO L273 TraceCheckUtils]: 37: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,005 INFO L273 TraceCheckUtils]: 39: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,006 INFO L273 TraceCheckUtils]: 41: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,006 INFO L273 TraceCheckUtils]: 43: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,007 INFO L273 TraceCheckUtils]: 45: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,007 INFO L273 TraceCheckUtils]: 46: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,007 INFO L273 TraceCheckUtils]: 48: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,007 INFO L273 TraceCheckUtils]: 49: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,008 INFO L273 TraceCheckUtils]: 51: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,008 INFO L273 TraceCheckUtils]: 52: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 55: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 56: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 57: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 58: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,009 INFO L273 TraceCheckUtils]: 62: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 64: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 68: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 69: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 70: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,010 INFO L273 TraceCheckUtils]: 71: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 72: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 73: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 74: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 76: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 77: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 78: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,011 INFO L273 TraceCheckUtils]: 79: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 80: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 81: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 82: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 83: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 84: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 85: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 86: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 87: Hoare triple {7567#false} havoc ~x~0;~x~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,012 INFO L273 TraceCheckUtils]: 88: Hoare triple {7567#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {7567#false} is VALID [2018-11-23 11:53:29,013 INFO L256 TraceCheckUtils]: 89: Hoare triple {7567#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7567#false} is VALID [2018-11-23 11:53:29,013 INFO L273 TraceCheckUtils]: 90: Hoare triple {7567#false} ~cond := #in~cond; {7567#false} is VALID [2018-11-23 11:53:29,013 INFO L273 TraceCheckUtils]: 91: Hoare triple {7567#false} assume 0 == ~cond; {7567#false} is VALID [2018-11-23 11:53:29,013 INFO L273 TraceCheckUtils]: 92: Hoare triple {7567#false} assume !false; {7567#false} is VALID [2018-11-23 11:53:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 11:53:29,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:29,017 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:29,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:29,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:29,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {7566#true} call ULTIMATE.init(); {7566#true} is VALID [2018-11-23 11:53:29,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {7566#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7566#true} is VALID [2018-11-23 11:53:29,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {7566#true} assume true; {7566#true} is VALID [2018-11-23 11:53:29,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7566#true} {7566#true} #91#return; {7566#true} is VALID [2018-11-23 11:53:29,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {7566#true} call #t~ret12 := main(); {7566#true} is VALID [2018-11-23 11:53:29,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {7566#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);havoc ~a~0;~a~0 := 0; {7600#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:29,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {7600#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7600#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:29,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {7600#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:29,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {7569#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7569#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:29,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {7569#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:29,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {7570#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7570#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:29,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {7570#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:29,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {7571#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7571#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:29,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {7571#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:29,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {7572#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7572#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:29,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {7572#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:29,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {7573#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7573#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:29,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {7573#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:29,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {7574#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7574#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:29,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {7574#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:29,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {7575#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7575#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:29,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {7575#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:29,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {7576#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7576#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:29,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {7576#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:29,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {7577#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7577#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:29,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {7577#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:29,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {7578#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7578#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:29,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {7578#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:29,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {7579#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7579#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:29,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {7579#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:29,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {7580#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {7580#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:29,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {7580#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {7581#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:29,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {7581#(<= main_~a~0 13)} assume !(~a~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {7567#false} havoc ~i~0;~i~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,553 INFO L273 TraceCheckUtils]: 36: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,553 INFO L273 TraceCheckUtils]: 37: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,554 INFO L273 TraceCheckUtils]: 42: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,554 INFO L273 TraceCheckUtils]: 43: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 44: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 45: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 47: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 48: Hoare triple {7567#false} 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; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 49: Hoare triple {7567#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 50: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 53: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 55: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 56: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 57: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 58: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 59: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 60: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,556 INFO L273 TraceCheckUtils]: 61: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 62: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 63: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 64: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 65: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 66: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 67: Hoare triple {7567#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 68: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,557 INFO L273 TraceCheckUtils]: 69: Hoare triple {7567#false} ~i~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 70: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 71: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 72: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 73: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 74: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 75: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 76: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 77: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,558 INFO L273 TraceCheckUtils]: 78: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 79: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 80: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 81: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 82: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 83: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 84: Hoare triple {7567#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 85: Hoare triple {7567#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {7567#false} is VALID [2018-11-23 11:53:29,559 INFO L273 TraceCheckUtils]: 86: Hoare triple {7567#false} assume !(~i~0 < 100000); {7567#false} is VALID [2018-11-23 11:53:29,560 INFO L273 TraceCheckUtils]: 87: Hoare triple {7567#false} havoc ~x~0;~x~0 := 0; {7567#false} is VALID [2018-11-23 11:53:29,560 INFO L273 TraceCheckUtils]: 88: Hoare triple {7567#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {7567#false} is VALID [2018-11-23 11:53:29,560 INFO L256 TraceCheckUtils]: 89: Hoare triple {7567#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {7567#false} is VALID [2018-11-23 11:53:29,560 INFO L273 TraceCheckUtils]: 90: Hoare triple {7567#false} ~cond := #in~cond; {7567#false} is VALID [2018-11-23 11:53:29,560 INFO L273 TraceCheckUtils]: 91: Hoare triple {7567#false} assume 0 == ~cond; {7567#false} is VALID [2018-11-23 11:53:29,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {7567#false} assume !false; {7567#false} is VALID [2018-11-23 11:53:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 11:53:29,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:29,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:53:29,584 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-23 11:53:29,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:29,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:53:29,641 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:29,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:53:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:53:29,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:53:29,643 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 17 states. [2018-11-23 11:53:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:30,810 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-23 11:53:30,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:53:30,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-11-23 11:53:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:53:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 11:53:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:53:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 11:53:30,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 84 transitions. [2018-11-23 11:53:31,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:31,028 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:53:31,028 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:53:31,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:53:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:53:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-11-23 11:53:31,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:31,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 100 states. [2018-11-23 11:53:31,073 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 100 states. [2018-11-23 11:53:31,073 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 100 states. [2018-11-23 11:53:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:31,076 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 11:53:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 11:53:31,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:31,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:31,076 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 101 states. [2018-11-23 11:53:31,077 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 101 states. [2018-11-23 11:53:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:31,079 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 11:53:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 11:53:31,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:31,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:31,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:31,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:53:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-11-23 11:53:31,082 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 93 [2018-11-23 11:53:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:31,082 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-23 11:53:31,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:53:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-11-23 11:53:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 11:53:31,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:31,083 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 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] [2018-11-23 11:53:31,084 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:31,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2067317950, now seen corresponding path program 14 times [2018-11-23 11:53:31,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:31,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:31,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:31,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2018-11-23 11:53:31,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {8457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8457#true} is VALID [2018-11-23 11:53:31,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2018-11-23 11:53:31,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #91#return; {8457#true} is VALID [2018-11-23 11:53:31,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret12 := main(); {8457#true} is VALID [2018-11-23 11:53:31,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {8457#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);havoc ~a~0;~a~0 := 0; {8459#(= main_~a~0 0)} is VALID [2018-11-23 11:53:31,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {8459#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8459#(= main_~a~0 0)} is VALID [2018-11-23 11:53:31,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {8459#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:31,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {8460#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:31,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {8460#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:31,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {8461#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:31,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {8461#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:31,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {8462#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:31,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {8462#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:31,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {8463#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:31,985 INFO L273 TraceCheckUtils]: 15: Hoare triple {8463#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:31,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {8464#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:31,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {8464#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:31,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {8465#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:31,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {8465#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:31,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {8466#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:31,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {8466#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:31,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {8467#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:31,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {8467#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:31,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {8468#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:31,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {8468#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:31,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {8469#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:31,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {8469#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:31,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {8470#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:31,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {8470#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:31,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {8471#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:31,996 INFO L273 TraceCheckUtils]: 31: Hoare triple {8471#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:31,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {8472#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:31,997 INFO L273 TraceCheckUtils]: 33: Hoare triple {8472#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8473#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:31,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {8473#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:31,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {8458#false} havoc ~i~0;~i~0 := 0; {8458#false} is VALID [2018-11-23 11:53:31,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:31,999 INFO L273 TraceCheckUtils]: 37: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:31,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:31,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:31,999 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:31,999 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:31,999 INFO L273 TraceCheckUtils]: 42: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,000 INFO L273 TraceCheckUtils]: 45: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,000 INFO L273 TraceCheckUtils]: 46: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 50: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 51: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 52: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 54: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,001 INFO L273 TraceCheckUtils]: 55: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 56: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 57: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 58: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 60: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 61: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 64: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 67: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 68: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 71: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,003 INFO L273 TraceCheckUtils]: 72: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 73: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 74: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 75: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 77: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 78: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 79: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,004 INFO L273 TraceCheckUtils]: 81: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 82: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 83: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 85: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 86: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 87: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 88: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {8458#false} havoc ~x~0;~x~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,006 INFO L273 TraceCheckUtils]: 90: Hoare triple {8458#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {8458#false} is VALID [2018-11-23 11:53:32,006 INFO L256 TraceCheckUtils]: 91: Hoare triple {8458#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {8458#false} is VALID [2018-11-23 11:53:32,006 INFO L273 TraceCheckUtils]: 92: Hoare triple {8458#false} ~cond := #in~cond; {8458#false} is VALID [2018-11-23 11:53:32,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {8458#false} assume 0 == ~cond; {8458#false} is VALID [2018-11-23 11:53:32,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2018-11-23 11:53:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 11:53:32,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:32,010 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:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:32,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:32,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:32,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:32,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {8457#true} call ULTIMATE.init(); {8457#true} is VALID [2018-11-23 11:53:32,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {8457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8457#true} is VALID [2018-11-23 11:53:32,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {8457#true} assume true; {8457#true} is VALID [2018-11-23 11:53:32,284 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8457#true} {8457#true} #91#return; {8457#true} is VALID [2018-11-23 11:53:32,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {8457#true} call #t~ret12 := main(); {8457#true} is VALID [2018-11-23 11:53:32,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {8457#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);havoc ~a~0;~a~0 := 0; {8492#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:32,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {8492#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8492#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:32,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {8492#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:32,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {8460#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8460#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:32,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {8460#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:32,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {8461#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8461#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:32,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {8461#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:32,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {8462#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8462#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:32,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {8462#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:32,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {8463#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8463#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:32,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {8463#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:32,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {8464#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8464#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:32,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {8464#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:32,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {8465#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8465#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:32,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {8465#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:32,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {8466#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8466#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:32,301 INFO L273 TraceCheckUtils]: 21: Hoare triple {8466#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:32,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {8467#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8467#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:32,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {8467#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:32,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {8468#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8468#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:32,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {8468#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:32,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {8469#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8469#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:32,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {8469#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:32,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {8470#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8470#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:32,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {8470#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:32,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {8471#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8471#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:32,307 INFO L273 TraceCheckUtils]: 31: Hoare triple {8471#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:32,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {8472#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {8472#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:32,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {8472#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {8473#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:32,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {8473#(<= main_~a~0 14)} assume !(~a~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,310 INFO L273 TraceCheckUtils]: 35: Hoare triple {8458#false} havoc ~i~0;~i~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,310 INFO L273 TraceCheckUtils]: 36: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,312 INFO L273 TraceCheckUtils]: 45: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,312 INFO L273 TraceCheckUtils]: 49: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,313 INFO L273 TraceCheckUtils]: 50: Hoare triple {8458#false} 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; {8458#false} is VALID [2018-11-23 11:53:32,313 INFO L273 TraceCheckUtils]: 51: Hoare triple {8458#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8458#false} is VALID [2018-11-23 11:53:32,313 INFO L273 TraceCheckUtils]: 52: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,313 INFO L273 TraceCheckUtils]: 54: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,314 INFO L273 TraceCheckUtils]: 55: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,314 INFO L273 TraceCheckUtils]: 56: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,314 INFO L273 TraceCheckUtils]: 57: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,314 INFO L273 TraceCheckUtils]: 58: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,314 INFO L273 TraceCheckUtils]: 59: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 60: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 61: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 62: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 63: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 64: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 65: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 66: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,315 INFO L273 TraceCheckUtils]: 67: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 68: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 69: Hoare triple {8458#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 71: Hoare triple {8458#false} ~i~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 72: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 73: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 74: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,316 INFO L273 TraceCheckUtils]: 75: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 76: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 77: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 78: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 79: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 80: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 81: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 82: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,317 INFO L273 TraceCheckUtils]: 83: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 84: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 85: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 86: Hoare triple {8458#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 87: Hoare triple {8458#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 88: Hoare triple {8458#false} assume !(~i~0 < 100000); {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 89: Hoare triple {8458#false} havoc ~x~0;~x~0 := 0; {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 90: Hoare triple {8458#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L256 TraceCheckUtils]: 91: Hoare triple {8458#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {8458#false} is VALID [2018-11-23 11:53:32,318 INFO L273 TraceCheckUtils]: 92: Hoare triple {8458#false} ~cond := #in~cond; {8458#false} is VALID [2018-11-23 11:53:32,319 INFO L273 TraceCheckUtils]: 93: Hoare triple {8458#false} assume 0 == ~cond; {8458#false} is VALID [2018-11-23 11:53:32,319 INFO L273 TraceCheckUtils]: 94: Hoare triple {8458#false} assume !false; {8458#false} is VALID [2018-11-23 11:53:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 11:53:32,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:32,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:53:32,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-11-23 11:53:32,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:32,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:53:32,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:32,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:53:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:53:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:53:32,404 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 18 states. [2018-11-23 11:53:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:32,871 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-11-23 11:53:32,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:53:32,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-11-23 11:53:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:53:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 11:53:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:53:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 11:53:32,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 11:53:32,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:32,970 INFO L225 Difference]: With dead ends: 168 [2018-11-23 11:53:32,970 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 11:53:32,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:53:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 11:53:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-23 11:53:33,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:33,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 102 states. [2018-11-23 11:53:33,013 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 102 states. [2018-11-23 11:53:33,013 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 102 states. [2018-11-23 11:53:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,015 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 11:53:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 11:53:33,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,016 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 103 states. [2018-11-23 11:53:33,016 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 103 states. [2018-11-23 11:53:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,018 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-23 11:53:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 11:53:33,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:33,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:53:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-11-23 11:53:33,021 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 95 [2018-11-23 11:53:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:33,021 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-11-23 11:53:33,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:53:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-11-23 11:53:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:53:33,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:33,023 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 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] [2018-11-23 11:53:33,023 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:33,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 73312, now seen corresponding path program 15 times [2018-11-23 11:53:33,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:33,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:33,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {9365#true} call ULTIMATE.init(); {9365#true} is VALID [2018-11-23 11:53:33,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {9365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9365#true} is VALID [2018-11-23 11:53:33,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {9365#true} assume true; {9365#true} is VALID [2018-11-23 11:53:33,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9365#true} {9365#true} #91#return; {9365#true} is VALID [2018-11-23 11:53:33,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {9365#true} call #t~ret12 := main(); {9365#true} is VALID [2018-11-23 11:53:33,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {9365#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);havoc ~a~0;~a~0 := 0; {9367#(= main_~a~0 0)} is VALID [2018-11-23 11:53:33,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {9367#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9367#(= main_~a~0 0)} is VALID [2018-11-23 11:53:33,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {9367#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9368#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:33,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {9368#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9368#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:33,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {9368#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9369#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:33,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {9369#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9369#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:33,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {9369#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9370#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:33,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {9370#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9370#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:33,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {9370#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9371#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:33,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {9371#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9371#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:33,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {9371#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9372#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:33,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {9372#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9372#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:33,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {9372#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9373#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:33,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {9373#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9373#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:33,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {9373#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9374#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:33,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {9374#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9374#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:33,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {9374#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9375#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:33,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {9375#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9375#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:33,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {9375#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9376#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:33,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {9376#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9376#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:33,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {9376#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9377#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:33,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {9377#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9377#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:33,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {9377#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9378#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:33,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {9378#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9378#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:33,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {9378#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9379#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:33,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {9379#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9379#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:33,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {9379#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9380#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:33,335 INFO L273 TraceCheckUtils]: 32: Hoare triple {9380#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9380#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:33,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {9380#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9381#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:33,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {9381#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9381#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:33,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {9381#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9382#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:33,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {9382#(<= main_~a~0 15)} assume !(~a~0 < 100000); {9366#false} is VALID [2018-11-23 11:53:33,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {9366#false} havoc ~i~0;~i~0 := 0; {9366#false} is VALID [2018-11-23 11:53:33,339 INFO L273 TraceCheckUtils]: 38: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,340 INFO L273 TraceCheckUtils]: 44: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,340 INFO L273 TraceCheckUtils]: 45: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {9366#false} 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; {9366#false} is VALID [2018-11-23 11:53:33,342 INFO L273 TraceCheckUtils]: 53: Hoare triple {9366#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9366#false} is VALID [2018-11-23 11:53:33,342 INFO L273 TraceCheckUtils]: 54: Hoare triple {9366#false} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 11:53:33,342 INFO L273 TraceCheckUtils]: 55: Hoare triple {9366#false} ~i~0 := 0; {9366#false} is VALID [2018-11-23 11:53:33,342 INFO L273 TraceCheckUtils]: 56: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,342 INFO L273 TraceCheckUtils]: 57: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,343 INFO L273 TraceCheckUtils]: 58: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,343 INFO L273 TraceCheckUtils]: 59: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,343 INFO L273 TraceCheckUtils]: 60: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,343 INFO L273 TraceCheckUtils]: 61: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 62: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 63: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 64: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 65: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 66: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 67: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 68: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,344 INFO L273 TraceCheckUtils]: 69: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 70: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 71: Hoare triple {9366#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 72: Hoare triple {9366#false} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 73: Hoare triple {9366#false} ~i~0 := 0; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 74: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 75: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 76: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 77: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,345 INFO L273 TraceCheckUtils]: 78: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 79: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 80: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 81: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 82: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 84: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 85: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 86: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,346 INFO L273 TraceCheckUtils]: 87: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 88: Hoare triple {9366#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 89: Hoare triple {9366#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 90: Hoare triple {9366#false} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 91: Hoare triple {9366#false} havoc ~x~0;~x~0 := 0; {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 92: Hoare triple {9366#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L256 TraceCheckUtils]: 93: Hoare triple {9366#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 94: Hoare triple {9366#false} ~cond := #in~cond; {9366#false} is VALID [2018-11-23 11:53:33,347 INFO L273 TraceCheckUtils]: 95: Hoare triple {9366#false} assume 0 == ~cond; {9366#false} is VALID [2018-11-23 11:53:33,348 INFO L273 TraceCheckUtils]: 96: Hoare triple {9366#false} assume !false; {9366#false} is VALID [2018-11-23 11:53:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 11:53:33,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:33,352 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:33,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:40,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:53:40,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:40,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:41,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {9365#true} call ULTIMATE.init(); {9365#true} is VALID [2018-11-23 11:53:41,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {9365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9365#true} is VALID [2018-11-23 11:53:41,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {9365#true} assume true; {9365#true} is VALID [2018-11-23 11:53:41,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9365#true} {9365#true} #91#return; {9365#true} is VALID [2018-11-23 11:53:41,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {9365#true} call #t~ret12 := main(); {9365#true} is VALID [2018-11-23 11:53:41,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {9365#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);havoc ~a~0;~a~0 := 0; {9365#true} is VALID [2018-11-23 11:53:41,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,134 INFO L273 TraceCheckUtils]: 30: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,134 INFO L273 TraceCheckUtils]: 31: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9365#true} is VALID [2018-11-23 11:53:41,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {9365#true} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9365#true} is VALID [2018-11-23 11:53:41,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {9365#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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {9488#(< main_~a~0 100000)} is VALID [2018-11-23 11:53:41,135 INFO L273 TraceCheckUtils]: 35: Hoare triple {9488#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {9492#(<= main_~a~0 100000)} is VALID [2018-11-23 11:53:41,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {9492#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {9365#true} is VALID [2018-11-23 11:53:41,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {9365#true} havoc ~i~0;~i~0 := 0; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 40: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 41: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 45: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 49: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 50: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 51: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 52: Hoare triple {9365#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; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 53: Hoare triple {9365#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {9365#true} assume !(~i~0 < 100000); {9365#true} is VALID [2018-11-23 11:53:41,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {9365#true} ~i~0 := 0; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 56: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 61: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 62: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,138 INFO L273 TraceCheckUtils]: 63: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 64: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 65: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 66: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 67: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 68: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 69: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {9365#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {9365#true} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {9365#true} is VALID [2018-11-23 11:53:41,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {9365#true} assume !(~i~0 < 100000); {9365#true} is VALID [2018-11-23 11:53:41,140 INFO L273 TraceCheckUtils]: 73: Hoare triple {9365#true} ~i~0 := 0; {9607#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:41,140 INFO L273 TraceCheckUtils]: 74: Hoare triple {9607#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9607#(<= main_~i~0 0)} is VALID [2018-11-23 11:53:41,141 INFO L273 TraceCheckUtils]: 75: Hoare triple {9607#(<= main_~i~0 0)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9614#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:41,141 INFO L273 TraceCheckUtils]: 76: Hoare triple {9614#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9614#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:41,142 INFO L273 TraceCheckUtils]: 77: Hoare triple {9614#(<= main_~i~0 1)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9621#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:41,142 INFO L273 TraceCheckUtils]: 78: Hoare triple {9621#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9621#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:41,142 INFO L273 TraceCheckUtils]: 79: Hoare triple {9621#(<= main_~i~0 2)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9628#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:41,143 INFO L273 TraceCheckUtils]: 80: Hoare triple {9628#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9628#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:41,143 INFO L273 TraceCheckUtils]: 81: Hoare triple {9628#(<= main_~i~0 3)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9635#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:41,143 INFO L273 TraceCheckUtils]: 82: Hoare triple {9635#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9635#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:41,144 INFO L273 TraceCheckUtils]: 83: Hoare triple {9635#(<= main_~i~0 4)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9642#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:41,145 INFO L273 TraceCheckUtils]: 84: Hoare triple {9642#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9642#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:41,145 INFO L273 TraceCheckUtils]: 85: Hoare triple {9642#(<= main_~i~0 5)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9649#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:41,146 INFO L273 TraceCheckUtils]: 86: Hoare triple {9649#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9649#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:41,147 INFO L273 TraceCheckUtils]: 87: Hoare triple {9649#(<= main_~i~0 6)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9656#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:41,147 INFO L273 TraceCheckUtils]: 88: Hoare triple {9656#(<= 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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {9656#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:41,148 INFO L273 TraceCheckUtils]: 89: Hoare triple {9656#(<= main_~i~0 7)} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {9663#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:41,149 INFO L273 TraceCheckUtils]: 90: Hoare triple {9663#(<= main_~i~0 8)} assume !(~i~0 < 100000); {9366#false} is VALID [2018-11-23 11:53:41,149 INFO L273 TraceCheckUtils]: 91: Hoare triple {9366#false} havoc ~x~0;~x~0 := 0; {9366#false} is VALID [2018-11-23 11:53:41,149 INFO L273 TraceCheckUtils]: 92: Hoare triple {9366#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {9366#false} is VALID [2018-11-23 11:53:41,149 INFO L256 TraceCheckUtils]: 93: Hoare triple {9366#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {9366#false} is VALID [2018-11-23 11:53:41,150 INFO L273 TraceCheckUtils]: 94: Hoare triple {9366#false} ~cond := #in~cond; {9366#false} is VALID [2018-11-23 11:53:41,150 INFO L273 TraceCheckUtils]: 95: Hoare triple {9366#false} assume 0 == ~cond; {9366#false} is VALID [2018-11-23 11:53:41,150 INFO L273 TraceCheckUtils]: 96: Hoare triple {9366#false} assume !false; {9366#false} is VALID [2018-11-23 11:53:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 29 proven. 64 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-11-23 11:53:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:41,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2018-11-23 11:53:41,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 97 [2018-11-23 11:53:41,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:41,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:53:41,266 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:53:41,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:53:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:53:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:53:41,268 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 29 states. [2018-11-23 11:53:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:42,502 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-11-23 11:53:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:53:42,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 97 [2018-11-23 11:53:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:53:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 147 transitions. [2018-11-23 11:53:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:53:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 147 transitions. [2018-11-23 11:53:42,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 147 transitions. [2018-11-23 11:53:42,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:42,690 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:53:42,690 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 11:53:42,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 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:53:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 11:53:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-11-23 11:53:42,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:42,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 112 states. [2018-11-23 11:53:42,814 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 112 states. [2018-11-23 11:53:42,814 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 112 states. [2018-11-23 11:53:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:42,819 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 11:53:42,819 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 11:53:42,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:42,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:42,820 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 115 states. [2018-11-23 11:53:42,820 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 115 states. [2018-11-23 11:53:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:42,833 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 11:53:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 11:53:42,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:42,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:42,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:42,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 11:53:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-11-23 11:53:42,840 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 97 [2018-11-23 11:53:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:42,840 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-11-23 11:53:42,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:53:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-23 11:53:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 11:53:42,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:42,841 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 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] [2018-11-23 11:53:42,841 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:42,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash -373193738, now seen corresponding path program 16 times [2018-11-23 11:53:42,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:42,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:42,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:42,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:42,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:43,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {10373#true} call ULTIMATE.init(); {10373#true} is VALID [2018-11-23 11:53:43,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {10373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10373#true} is VALID [2018-11-23 11:53:43,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {10373#true} assume true; {10373#true} is VALID [2018-11-23 11:53:43,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10373#true} {10373#true} #91#return; {10373#true} is VALID [2018-11-23 11:53:43,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {10373#true} call #t~ret12 := main(); {10373#true} is VALID [2018-11-23 11:53:43,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {10373#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);havoc ~a~0;~a~0 := 0; {10375#(= main_~a~0 0)} is VALID [2018-11-23 11:53:43,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {10375#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10375#(= main_~a~0 0)} is VALID [2018-11-23 11:53:43,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {10375#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10376#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:43,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {10376#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10376#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:43,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {10376#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10377#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:43,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {10377#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10377#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:43,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {10377#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10378#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:43,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {10378#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10378#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:43,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {10378#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10379#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:43,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {10379#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10379#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:43,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {10379#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10380#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:43,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {10380#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10380#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:43,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {10380#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10381#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:43,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {10381#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10381#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:43,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {10381#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10382#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:43,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {10382#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10382#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:43,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {10382#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10383#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:43,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {10383#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10383#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:43,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {10383#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10384#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:43,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {10384#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10384#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:43,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {10384#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10385#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:43,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {10385#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10385#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:43,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {10385#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10386#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:43,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {10386#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10386#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:43,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {10386#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10387#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:43,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {10387#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10387#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:43,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {10387#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10388#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:43,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {10388#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10388#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:43,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {10388#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10389#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:43,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {10389#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10389#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:43,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {10389#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10390#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:43,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {10390#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10390#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:43,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {10390#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10391#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:43,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {10391#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10391#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:43,678 INFO L273 TraceCheckUtils]: 39: Hoare triple {10391#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10392#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:43,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {10392#(<= main_~a~0 17)} assume !(~a~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:43,679 INFO L273 TraceCheckUtils]: 41: Hoare triple {10374#false} havoc ~i~0;~i~0 := 0; {10374#false} is VALID [2018-11-23 11:53:43,679 INFO L273 TraceCheckUtils]: 42: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,680 INFO L273 TraceCheckUtils]: 43: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,680 INFO L273 TraceCheckUtils]: 44: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,680 INFO L273 TraceCheckUtils]: 45: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,681 INFO L273 TraceCheckUtils]: 50: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,681 INFO L273 TraceCheckUtils]: 51: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,681 INFO L273 TraceCheckUtils]: 52: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,682 INFO L273 TraceCheckUtils]: 53: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,682 INFO L273 TraceCheckUtils]: 54: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,682 INFO L273 TraceCheckUtils]: 55: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,682 INFO L273 TraceCheckUtils]: 56: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,682 INFO L273 TraceCheckUtils]: 57: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,682 INFO L273 TraceCheckUtils]: 58: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 59: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 60: Hoare triple {10374#false} assume !(~i~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 61: Hoare triple {10374#false} ~i~0 := 0; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 62: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 63: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 64: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 65: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 66: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,683 INFO L273 TraceCheckUtils]: 67: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 68: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 70: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 71: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 72: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 73: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 74: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 75: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,684 INFO L273 TraceCheckUtils]: 76: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 77: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 78: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 79: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 80: Hoare triple {10374#false} assume !(~i~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 81: Hoare triple {10374#false} ~i~0 := 0; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 82: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 83: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,685 INFO L273 TraceCheckUtils]: 84: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 85: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 86: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 87: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 88: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 89: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 90: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 91: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,686 INFO L273 TraceCheckUtils]: 92: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 93: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 94: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 95: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 96: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 97: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 98: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 99: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 100: Hoare triple {10374#false} assume !(~i~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:43,687 INFO L273 TraceCheckUtils]: 101: Hoare triple {10374#false} havoc ~x~0;~x~0 := 0; {10374#false} is VALID [2018-11-23 11:53:43,688 INFO L273 TraceCheckUtils]: 102: Hoare triple {10374#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {10374#false} is VALID [2018-11-23 11:53:43,688 INFO L256 TraceCheckUtils]: 103: Hoare triple {10374#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {10374#false} is VALID [2018-11-23 11:53:43,688 INFO L273 TraceCheckUtils]: 104: Hoare triple {10374#false} ~cond := #in~cond; {10374#false} is VALID [2018-11-23 11:53:43,688 INFO L273 TraceCheckUtils]: 105: Hoare triple {10374#false} assume 0 == ~cond; {10374#false} is VALID [2018-11-23 11:53:43,688 INFO L273 TraceCheckUtils]: 106: Hoare triple {10374#false} assume !false; {10374#false} is VALID [2018-11-23 11:53:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-23 11:53:43,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:43,693 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:53:43,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:43,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:43,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:43,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:44,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {10373#true} call ULTIMATE.init(); {10373#true} is VALID [2018-11-23 11:53:44,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {10373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10373#true} is VALID [2018-11-23 11:53:44,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {10373#true} assume true; {10373#true} is VALID [2018-11-23 11:53:44,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10373#true} {10373#true} #91#return; {10373#true} is VALID [2018-11-23 11:53:44,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {10373#true} call #t~ret12 := main(); {10373#true} is VALID [2018-11-23 11:53:44,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {10373#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);havoc ~a~0;~a~0 := 0; {10411#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:44,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {10411#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10411#(<= main_~a~0 0)} is VALID [2018-11-23 11:53:44,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {10411#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10376#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:44,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {10376#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10376#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:44,012 INFO L273 TraceCheckUtils]: 9: Hoare triple {10376#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10377#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:44,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {10377#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10377#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:44,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {10377#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10378#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:44,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {10378#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10378#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:44,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {10378#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10379#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:44,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {10379#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10379#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:44,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {10379#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10380#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:44,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {10380#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10380#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:44,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {10380#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10381#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:44,017 INFO L273 TraceCheckUtils]: 18: Hoare triple {10381#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10381#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:44,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {10381#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10382#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:44,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {10382#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10382#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:44,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {10382#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10383#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:44,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {10383#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10383#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:44,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {10383#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10384#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:44,021 INFO L273 TraceCheckUtils]: 24: Hoare triple {10384#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10384#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:44,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {10384#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10385#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:44,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {10385#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10385#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:44,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {10385#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10386#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:44,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {10386#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10386#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:44,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {10386#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10387#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:44,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {10387#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10387#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:44,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {10387#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10388#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:44,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {10388#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10388#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:44,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {10388#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10389#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:44,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {10389#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10389#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:44,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {10389#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10390#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:44,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {10390#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10390#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:44,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {10390#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10391#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:44,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {10391#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {10391#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:44,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {10391#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {10392#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:44,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {10392#(<= main_~a~0 17)} assume !(~a~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:44,032 INFO L273 TraceCheckUtils]: 41: Hoare triple {10374#false} havoc ~i~0;~i~0 := 0; {10374#false} is VALID [2018-11-23 11:53:44,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,033 INFO L273 TraceCheckUtils]: 45: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,033 INFO L273 TraceCheckUtils]: 46: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,034 INFO L273 TraceCheckUtils]: 50: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,034 INFO L273 TraceCheckUtils]: 51: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,034 INFO L273 TraceCheckUtils]: 53: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,034 INFO L273 TraceCheckUtils]: 54: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 55: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 56: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 57: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {10374#false} 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; {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {10374#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 60: Hoare triple {10374#false} assume !(~i~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:44,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {10374#false} ~i~0 := 0; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 62: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 63: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 64: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 65: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 67: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 69: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 71: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 72: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 73: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 74: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 75: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 76: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 77: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 78: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {10374#false} is VALID [2018-11-23 11:53:44,037 INFO L273 TraceCheckUtils]: 79: Hoare triple {10374#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 80: Hoare triple {10374#false} assume !(~i~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 81: Hoare triple {10374#false} ~i~0 := 0; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 82: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 83: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 84: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 85: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 86: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 87: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,038 INFO L273 TraceCheckUtils]: 88: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 89: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 90: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 91: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 92: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 93: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 94: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 97: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 98: Hoare triple {10374#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 99: Hoare triple {10374#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 100: Hoare triple {10374#false} assume !(~i~0 < 100000); {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 101: Hoare triple {10374#false} havoc ~x~0;~x~0 := 0; {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {10374#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L256 TraceCheckUtils]: 103: Hoare triple {10374#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 104: Hoare triple {10374#false} ~cond := #in~cond; {10374#false} is VALID [2018-11-23 11:53:44,040 INFO L273 TraceCheckUtils]: 105: Hoare triple {10374#false} assume 0 == ~cond; {10374#false} is VALID [2018-11-23 11:53:44,041 INFO L273 TraceCheckUtils]: 106: Hoare triple {10374#false} assume !false; {10374#false} is VALID [2018-11-23 11:53:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-23 11:53:44,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:44,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:53:44,066 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2018-11-23 11:53:44,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:44,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:53:44,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:53:44,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:53:44,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:53:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:53:44,133 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 21 states. [2018-11-23 11:53:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:44,754 INFO L93 Difference]: Finished difference Result 186 states and 194 transitions. [2018-11-23 11:53:44,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:53:44,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2018-11-23 11:53:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:53:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2018-11-23 11:53:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:53:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2018-11-23 11:53:44,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 92 transitions. [2018-11-23 11:53:44,847 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:44,849 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:53:44,849 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 11:53:44,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 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:53:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 11:53:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-23 11:53:44,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:44,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 114 states. [2018-11-23 11:53:44,914 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 114 states. [2018-11-23 11:53:44,914 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 114 states. [2018-11-23 11:53:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:44,917 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 11:53:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 11:53:44,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:44,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:44,918 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 115 states. [2018-11-23 11:53:44,918 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 115 states. [2018-11-23 11:53:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:44,920 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-23 11:53:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 11:53:44,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:44,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:44,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:44,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:53:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-11-23 11:53:44,922 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 107 [2018-11-23 11:53:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:44,923 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-11-23 11:53:44,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:53:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-11-23 11:53:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:53:44,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:44,924 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 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] [2018-11-23 11:53:44,924 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:44,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2040113684, now seen corresponding path program 17 times [2018-11-23 11:53:44,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:44,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:45,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2018-11-23 11:53:45,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {11389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11389#true} is VALID [2018-11-23 11:53:45,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2018-11-23 11:53:45,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #91#return; {11389#true} is VALID [2018-11-23 11:53:45,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret12 := main(); {11389#true} is VALID [2018-11-23 11:53:45,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {11389#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);havoc ~a~0;~a~0 := 0; {11391#(= main_~a~0 0)} is VALID [2018-11-23 11:53:45,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {11391#(= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11391#(= main_~a~0 0)} is VALID [2018-11-23 11:53:45,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {11391#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11392#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:45,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {11392#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11392#(<= main_~a~0 1)} is VALID [2018-11-23 11:53:45,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {11392#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11393#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:45,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {11393#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11393#(<= main_~a~0 2)} is VALID [2018-11-23 11:53:45,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {11393#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11394#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:45,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {11394#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11394#(<= main_~a~0 3)} is VALID [2018-11-23 11:53:45,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {11394#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11395#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:45,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {11395#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11395#(<= main_~a~0 4)} is VALID [2018-11-23 11:53:45,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {11395#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11396#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:45,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {11396#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11396#(<= main_~a~0 5)} is VALID [2018-11-23 11:53:45,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {11396#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11397#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:45,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {11397#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11397#(<= main_~a~0 6)} is VALID [2018-11-23 11:53:45,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {11397#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11398#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:45,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {11398#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11398#(<= main_~a~0 7)} is VALID [2018-11-23 11:53:45,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {11398#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11399#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:45,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {11399#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11399#(<= main_~a~0 8)} is VALID [2018-11-23 11:53:45,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {11399#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11400#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:45,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {11400#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11400#(<= main_~a~0 9)} is VALID [2018-11-23 11:53:45,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {11400#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11401#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:45,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {11401#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11401#(<= main_~a~0 10)} is VALID [2018-11-23 11:53:45,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {11401#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11402#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:45,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {11402#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11402#(<= main_~a~0 11)} is VALID [2018-11-23 11:53:45,372 INFO L273 TraceCheckUtils]: 29: Hoare triple {11402#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11403#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:45,372 INFO L273 TraceCheckUtils]: 30: Hoare triple {11403#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11403#(<= main_~a~0 12)} is VALID [2018-11-23 11:53:45,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {11403#(<= main_~a~0 12)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11404#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:45,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {11404#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11404#(<= main_~a~0 13)} is VALID [2018-11-23 11:53:45,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {11404#(<= main_~a~0 13)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11405#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:45,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {11405#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11405#(<= main_~a~0 14)} is VALID [2018-11-23 11:53:45,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {11405#(<= main_~a~0 14)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11406#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:45,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {11406#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11406#(<= main_~a~0 15)} is VALID [2018-11-23 11:53:45,382 INFO L273 TraceCheckUtils]: 37: Hoare triple {11406#(<= main_~a~0 15)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11407#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:45,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {11407#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11407#(<= main_~a~0 16)} is VALID [2018-11-23 11:53:45,385 INFO L273 TraceCheckUtils]: 39: Hoare triple {11407#(<= main_~a~0 16)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11408#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:45,385 INFO L273 TraceCheckUtils]: 40: Hoare triple {11408#(<= 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, ~#a3~0.base, ~#a3~0.offset + 4 * ~a~0, 4);havoc #t~nondet2; {11408#(<= main_~a~0 17)} is VALID [2018-11-23 11:53:45,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {11408#(<= main_~a~0 17)} #t~post0 := ~a~0;~a~0 := 1 + #t~post0;havoc #t~post0; {11409#(<= main_~a~0 18)} is VALID [2018-11-23 11:53:45,387 INFO L273 TraceCheckUtils]: 42: Hoare triple {11409#(<= main_~a~0 18)} assume !(~a~0 < 100000); {11390#false} is VALID [2018-11-23 11:53:45,387 INFO L273 TraceCheckUtils]: 43: Hoare triple {11390#false} havoc ~i~0;~i~0 := 0; {11390#false} is VALID [2018-11-23 11:53:45,387 INFO L273 TraceCheckUtils]: 44: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,387 INFO L273 TraceCheckUtils]: 45: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 46: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 47: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 48: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 49: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 51: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 53: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,388 INFO L273 TraceCheckUtils]: 54: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 55: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 56: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 57: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 58: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 59: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {11390#false} 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; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {11390#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 62: Hoare triple {11390#false} assume !(~i~0 < 100000); {11390#false} is VALID [2018-11-23 11:53:45,389 INFO L273 TraceCheckUtils]: 63: Hoare triple {11390#false} ~i~0 := 0; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 64: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 65: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 66: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 68: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 70: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,390 INFO L273 TraceCheckUtils]: 71: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 72: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 73: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 74: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 76: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 77: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 78: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 79: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,391 INFO L273 TraceCheckUtils]: 80: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem6; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 81: Hoare triple {11390#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 82: Hoare triple {11390#false} assume !(~i~0 < 100000); {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 83: Hoare triple {11390#false} ~i~0 := 0; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 84: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 85: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 86: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 87: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 88: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,392 INFO L273 TraceCheckUtils]: 89: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 90: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 91: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 92: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 93: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 94: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 95: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 96: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 97: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,393 INFO L273 TraceCheckUtils]: 98: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 99: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 100: Hoare triple {11390#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, ~#a4~0.base, ~#a4~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 101: Hoare triple {11390#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 102: Hoare triple {11390#false} assume !(~i~0 < 100000); {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 103: Hoare triple {11390#false} havoc ~x~0;~x~0 := 0; {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 104: Hoare triple {11390#false} assume !!(~x~0 < 100000);call #t~mem10 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem11 := read~int(~#a4~0.base, ~#a4~0.offset + 4 * ~x~0, 4); {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L256 TraceCheckUtils]: 105: Hoare triple {11390#false} call __VERIFIER_assert((if #t~mem10 == #t~mem11 then 1 else 0)); {11390#false} is VALID [2018-11-23 11:53:45,394 INFO L273 TraceCheckUtils]: 106: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2018-11-23 11:53:45,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2018-11-23 11:53:45,395 INFO L273 TraceCheckUtils]: 108: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2018-11-23 11:53:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-11-23 11:53:45,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:45,400 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:53:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1