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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:56:35,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:56:35,847 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:56:35,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:56:35,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:56:35,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:56:35,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:56:35,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:56:35,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:56:35,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:56:35,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:56:35,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:56:35,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:56:35,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:56:35,873 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:56:35,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:56:35,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:56:35,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:56:35,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:56:35,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:56:35,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:56:35,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:56:35,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:56:35,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:56:35,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:56:35,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:56:35,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:56:35,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:56:35,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:56:35,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:56:35,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:56:35,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:56:35,910 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:56:35,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:56:35,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:56:35,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:56:35,914 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-18 22:56:35,946 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:56:35,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:56:35,947 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:56:35,947 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:56:35,948 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:56:35,948 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:56:35,949 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:56:35,949 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:56:35,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:56:35,949 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:56:35,949 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:56:35,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:56:35,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:56:35,950 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:56:35,950 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:56:35,950 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:56:35,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:56:35,951 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:56:35,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:56:35,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:56:35,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:56:35,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:56:35,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:56:35,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:56:35,954 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:56:35,954 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:56:35,954 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:56:35,954 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:56:35,954 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:56:35,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:56:35,955 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:56:36,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:56:36,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:56:36,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:56:36,043 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:56:36,043 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:56:36,044 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-11-18 22:56:36,105 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f596354d/c35cd0923c0a4c7fab7c2b04620b66b5/FLAGac56303a2 [2018-11-18 22:56:36,586 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:56:36,586 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-11-18 22:56:36,592 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f596354d/c35cd0923c0a4c7fab7c2b04620b66b5/FLAGac56303a2 [2018-11-18 22:56:36,978 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f596354d/c35cd0923c0a4c7fab7c2b04620b66b5 [2018-11-18 22:56:36,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:56:36,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:56:36,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:56:36,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:56:36,996 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:56:36,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:36" (1/1) ... [2018-11-18 22:56:37,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8a5721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:36, skipping insertion in model container [2018-11-18 22:56:37,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:56:36" (1/1) ... [2018-11-18 22:56:37,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:56:37,031 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:56:37,293 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:56:37,297 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:56:37,336 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:56:37,362 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:56:37,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37 WrapperNode [2018-11-18 22:56:37,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:56:37,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:56:37,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:56:37,363 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:56:37,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (1/1) ... [2018-11-18 22:56:37,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:56:37,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:56:37,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:56:37,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:56:37,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (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-18 22:56:37,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:56:37,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:56:37,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:56:37,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:56:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:56:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:56:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:56:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:56:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:56:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:56:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:56:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:56:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:56:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:56:38,211 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:56:38,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:38 BoogieIcfgContainer [2018-11-18 22:56:38,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:56:38,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:56:38,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:56:38,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:56:38,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:56:36" (1/3) ... [2018-11-18 22:56:38,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718ace4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:38, skipping insertion in model container [2018-11-18 22:56:38,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:56:37" (2/3) ... [2018-11-18 22:56:38,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718ace4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:56:38, skipping insertion in model container [2018-11-18 22:56:38,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:56:38" (3/3) ... [2018-11-18 22:56:38,221 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partial_init_true-unreach-call_ground.i [2018-11-18 22:56:38,231 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:56:38,241 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:56:38,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:56:38,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:56:38,292 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:56:38,292 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:56:38,293 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:56:38,293 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:56:38,293 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:56:38,294 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:56:38,294 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:56:38,294 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:56:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 22:56:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:56:38,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:38,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:38,329 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:38,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1830056170, now seen corresponding path program 1 times [2018-11-18 22:56:38,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:38,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:38,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-18 22:56:38,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-18 22:56:38,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-18 22:56:38,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #73#return; {36#true} is VALID [2018-11-18 22:56:38,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2018-11-18 22:56:38,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-18 22:56:38,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-18 22:56:38,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-18 22:56:38,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-18 22:56:38,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {37#false} is VALID [2018-11-18 22:56:38,551 INFO L256 TraceCheckUtils]: 10: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {37#false} is VALID [2018-11-18 22:56:38,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-18 22:56:38,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2018-11-18 22:56:38,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-18 22:56:38,555 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-18 22:56:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:56:38,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:56:38,564 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 22:56:38,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:38,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:56:38,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:38,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:56:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:56:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:56:38,678 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-18 22:56:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:38,840 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-18 22:56:38,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:56:38,840 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 22:56:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:56:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-18 22:56:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:56:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-18 22:56:38,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-18 22:56:39,234 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-18 22:56:39,246 INFO L225 Difference]: With dead ends: 56 [2018-11-18 22:56:39,246 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 22:56:39,250 INFO L604 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-18 22:56:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 22:56:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 22:56:39,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:39,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-18 22:56:39,302 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 22:56:39,302 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 22:56:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:39,308 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 22:56:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 22:56:39,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:39,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:39,309 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 22:56:39,310 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 22:56:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:39,315 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 22:56:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 22:56:39,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:39,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:39,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:39,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:56:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 22:56:39,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-18 22:56:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:39,323 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 22:56:39,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:56:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 22:56:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:56:39,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:39,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:39,325 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:39,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:39,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1980842670, now seen corresponding path program 1 times [2018-11-18 22:56:39,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:39,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:39,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:39,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:39,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:39,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {205#true} is VALID [2018-11-18 22:56:39,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {205#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {205#true} is VALID [2018-11-18 22:56:39,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2018-11-18 22:56:39,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #73#return; {205#true} is VALID [2018-11-18 22:56:39,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret7 := main(); {205#true} is VALID [2018-11-18 22:56:39,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {205#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {207#(= main_~i~0 0)} is VALID [2018-11-18 22:56:39,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {207#(= main_~i~0 0)} assume true; {207#(= main_~i~0 0)} is VALID [2018-11-18 22:56:39,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {207#(= main_~i~0 0)} assume !(~i~0 < 100000); {206#false} is VALID [2018-11-18 22:56:39,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#false} havoc ~x~0;~x~0 := 0; {206#false} is VALID [2018-11-18 22:56:39,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#false} assume true; {206#false} is VALID [2018-11-18 22:56:39,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {206#false} is VALID [2018-11-18 22:56:39,436 INFO L256 TraceCheckUtils]: 11: Hoare triple {206#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {206#false} is VALID [2018-11-18 22:56:39,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2018-11-18 22:56:39,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#false} assume 0 == ~cond; {206#false} is VALID [2018-11-18 22:56:39,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#false} assume !false; {206#false} is VALID [2018-11-18 22:56:39,438 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-18 22:56:39,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:56:39,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:56:39,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:56:39,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:39,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:56:39,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:39,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:56:39,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:56:39,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:56:39,498 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-18 22:56:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:39,738 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-18 22:56:39,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:56:39,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:56:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:56:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-18 22:56:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:56:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-18 22:56:39,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-18 22:56:40,107 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-18 22:56:40,109 INFO L225 Difference]: With dead ends: 50 [2018-11-18 22:56:40,111 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 22:56:40,113 INFO L604 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-18 22:56:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 22:56:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 22:56:40,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:40,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-18 22:56:40,144 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-18 22:56:40,144 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-18 22:56:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:40,147 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-18 22:56:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-18 22:56:40,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:40,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:40,150 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-18 22:56:40,150 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-18 22:56:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:40,155 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-18 22:56:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-18 22:56:40,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:40,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:40,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:40,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:56:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 22:56:40,160 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-18 22:56:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:40,162 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 22:56:40,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:56:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 22:56:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:56:40,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:40,163 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:40,164 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:40,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash -200640663, now seen corresponding path program 1 times [2018-11-18 22:56:40,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:40,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:40,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:40,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:40,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-18 22:56:40,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {381#true} is VALID [2018-11-18 22:56:40,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-18 22:56:40,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #73#return; {381#true} is VALID [2018-11-18 22:56:40,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret7 := main(); {381#true} is VALID [2018-11-18 22:56:40,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {383#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {383#(= main_~i~0 0)} assume true; {383#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {383#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {383#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {383#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {383#(= main_~i~0 0)} is VALID [2018-11-18 22:56:40,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {383#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {384#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(<= main_~i~0 1)} assume true; {384#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {384#(<= main_~i~0 1)} assume !(~i~0 < 100000); {382#false} is VALID [2018-11-18 22:56:40,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#false} havoc ~x~0;~x~0 := 0; {382#false} is VALID [2018-11-18 22:56:40,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#false} assume true; {382#false} is VALID [2018-11-18 22:56:40,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {382#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {382#false} is VALID [2018-11-18 22:56:40,266 INFO L256 TraceCheckUtils]: 15: Hoare triple {382#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {382#false} is VALID [2018-11-18 22:56:40,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-18 22:56:40,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-18 22:56:40,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-18 22:56:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:40,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:40,269 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-18 22:56:40,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:40,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:40,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-18 22:56:40,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {381#true} is VALID [2018-11-18 22:56:40,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-18 22:56:40,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #73#return; {381#true} is VALID [2018-11-18 22:56:40,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret7 := main(); {381#true} is VALID [2018-11-18 22:56:40,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {403#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(<= main_~i~0 0)} assume true; {403#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {403#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {403#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {403#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:40,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {403#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {384#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(<= main_~i~0 1)} assume true; {384#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:40,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {384#(<= main_~i~0 1)} assume !(~i~0 < 100000); {382#false} is VALID [2018-11-18 22:56:40,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#false} havoc ~x~0;~x~0 := 0; {382#false} is VALID [2018-11-18 22:56:40,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#false} assume true; {382#false} is VALID [2018-11-18 22:56:40,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {382#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {382#false} is VALID [2018-11-18 22:56:40,535 INFO L256 TraceCheckUtils]: 15: Hoare triple {382#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {382#false} is VALID [2018-11-18 22:56:40,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-18 22:56:40,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-18 22:56:40,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-18 22:56:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:40,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:40,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:56:40,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 22:56:40,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:40,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:56:40,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:40,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:56:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:56:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:56:40,644 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-18 22:56:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,056 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-18 22:56:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:56:41,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 22:56:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:56:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-18 22:56:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:56:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-18 22:56:41,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-18 22:56:41,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:41,243 INFO L225 Difference]: With dead ends: 54 [2018-11-18 22:56:41,243 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 22:56:41,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:56:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 22:56:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 22:56:41,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:41,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-18 22:56:41,282 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-18 22:56:41,283 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-18 22:56:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,286 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 22:56:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-18 22:56:41,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:41,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:41,287 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-18 22:56:41,287 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-18 22:56:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,291 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 22:56:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-18 22:56:41,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:41,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:41,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:41,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:56:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-18 22:56:41,295 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 19 [2018-11-18 22:56:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:41,296 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 22:56:41,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:56:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 22:56:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 22:56:41,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:41,297 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:41,297 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:41,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 385699328, now seen corresponding path program 2 times [2018-11-18 22:56:41,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:41,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:41,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:41,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2018-11-18 22:56:41,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {631#true} is VALID [2018-11-18 22:56:41,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {631#true} assume true; {631#true} is VALID [2018-11-18 22:56:41,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {631#true} {631#true} #73#return; {631#true} is VALID [2018-11-18 22:56:41,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {631#true} call #t~ret7 := main(); {631#true} is VALID [2018-11-18 22:56:41,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {631#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {633#(= main_~i~0 0)} is VALID [2018-11-18 22:56:41,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {633#(= main_~i~0 0)} assume true; {633#(= main_~i~0 0)} is VALID [2018-11-18 22:56:41,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {633#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {633#(= main_~i~0 0)} is VALID [2018-11-18 22:56:41,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {633#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {633#(= main_~i~0 0)} is VALID [2018-11-18 22:56:41,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {633#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {634#(<= main_~i~0 1)} assume true; {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {634#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,440 INFO L273 TraceCheckUtils]: 12: Hoare triple {634#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {634#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {635#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:41,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(<= main_~i~0 2)} assume true; {635#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:41,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#(<= main_~i~0 2)} assume !(~i~0 < 100000); {632#false} is VALID [2018-11-18 22:56:41,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {632#false} havoc ~x~0;~x~0 := 0; {632#false} is VALID [2018-11-18 22:56:41,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {632#false} assume true; {632#false} is VALID [2018-11-18 22:56:41,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {632#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {632#false} is VALID [2018-11-18 22:56:41,443 INFO L256 TraceCheckUtils]: 19: Hoare triple {632#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {632#false} is VALID [2018-11-18 22:56:41,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2018-11-18 22:56:41,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {632#false} assume 0 == ~cond; {632#false} is VALID [2018-11-18 22:56:41,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {632#false} assume !false; {632#false} is VALID [2018-11-18 22:56:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:41,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:41,447 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-18 22:56:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:41,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:41,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:41,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:41,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {631#true} call ULTIMATE.init(); {631#true} is VALID [2018-11-18 22:56:41,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {631#true} is VALID [2018-11-18 22:56:41,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {631#true} assume true; {631#true} is VALID [2018-11-18 22:56:41,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {631#true} {631#true} #73#return; {631#true} is VALID [2018-11-18 22:56:41,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {631#true} call #t~ret7 := main(); {631#true} is VALID [2018-11-18 22:56:41,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {631#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {654#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:41,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {654#(<= main_~i~0 0)} assume true; {654#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:41,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {654#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:41,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {654#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:41,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {634#(<= main_~i~0 1)} assume true; {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {634#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {634#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {634#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:41,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {634#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {635#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:41,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(<= main_~i~0 2)} assume true; {635#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:41,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {635#(<= main_~i~0 2)} assume !(~i~0 < 100000); {632#false} is VALID [2018-11-18 22:56:41,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {632#false} havoc ~x~0;~x~0 := 0; {632#false} is VALID [2018-11-18 22:56:41,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {632#false} assume true; {632#false} is VALID [2018-11-18 22:56:41,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {632#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {632#false} is VALID [2018-11-18 22:56:41,657 INFO L256 TraceCheckUtils]: 19: Hoare triple {632#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {632#false} is VALID [2018-11-18 22:56:41,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {632#false} ~cond := #in~cond; {632#false} is VALID [2018-11-18 22:56:41,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {632#false} assume 0 == ~cond; {632#false} is VALID [2018-11-18 22:56:41,658 INFO L273 TraceCheckUtils]: 22: Hoare triple {632#false} assume !false; {632#false} is VALID [2018-11-18 22:56:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:41,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:41,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:56:41,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 22:56:41,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:41,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:56:41,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:41,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:56:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:56:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:56:41,718 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2018-11-18 22:56:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:41,956 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-18 22:56:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:56:41,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-18 22:56:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:56:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-18 22:56:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:56:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2018-11-18 22:56:41,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2018-11-18 22:56:42,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:42,054 INFO L225 Difference]: With dead ends: 58 [2018-11-18 22:56:42,054 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 22:56:42,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:56:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 22:56:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-18 22:56:42,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:42,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-18 22:56:42,074 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-18 22:56:42,075 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-18 22:56:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:42,077 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-18 22:56:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-18 22:56:42,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:42,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:42,079 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-18 22:56:42,079 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-18 22:56:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:42,082 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-18 22:56:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-18 22:56:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:42,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:42,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:42,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:56:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-11-18 22:56:42,086 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2018-11-18 22:56:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:42,086 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-18 22:56:42,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:56:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-18 22:56:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 22:56:42,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:42,088 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:42,089 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:42,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:42,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1088749847, now seen corresponding path program 3 times [2018-11-18 22:56:42,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:42,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:42,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:42,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:42,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2018-11-18 22:56:42,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {912#true} is VALID [2018-11-18 22:56:42,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2018-11-18 22:56:42,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #73#return; {912#true} is VALID [2018-11-18 22:56:42,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret7 := main(); {912#true} is VALID [2018-11-18 22:56:42,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {914#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#(= main_~i~0 0)} assume true; {914#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {914#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {914#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {914#(= main_~i~0 0)} is VALID [2018-11-18 22:56:42,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(<= main_~i~0 1)} assume true; {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(<= main_~i~0 2)} assume true; {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {916#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {917#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {917#(<= main_~i~0 3)} assume true; {917#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {917#(<= main_~i~0 3)} assume !(~i~0 < 100000); {913#false} is VALID [2018-11-18 22:56:42,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {913#false} havoc ~x~0;~x~0 := 0; {913#false} is VALID [2018-11-18 22:56:42,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {913#false} assume true; {913#false} is VALID [2018-11-18 22:56:42,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {913#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {913#false} is VALID [2018-11-18 22:56:42,290 INFO L256 TraceCheckUtils]: 23: Hoare triple {913#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {913#false} is VALID [2018-11-18 22:56:42,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2018-11-18 22:56:42,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2018-11-18 22:56:42,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {913#false} assume !false; {913#false} is VALID [2018-11-18 22:56:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:42,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:42,293 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-18 22:56:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:56:42,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:56:42,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:42,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:42,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2018-11-18 22:56:42,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {912#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {912#true} is VALID [2018-11-18 22:56:42,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2018-11-18 22:56:42,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #73#return; {912#true} is VALID [2018-11-18 22:56:42,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret7 := main(); {912#true} is VALID [2018-11-18 22:56:42,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {936#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:42,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {936#(<= main_~i~0 0)} assume true; {936#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:42,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {936#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {936#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:42,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {936#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {936#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:42,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {936#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(<= main_~i~0 1)} assume true; {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {915#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:42,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {915#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(<= main_~i~0 2)} assume true; {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {916#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:42,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {916#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {917#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {917#(<= main_~i~0 3)} assume true; {917#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:42,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {917#(<= main_~i~0 3)} assume !(~i~0 < 100000); {913#false} is VALID [2018-11-18 22:56:42,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {913#false} havoc ~x~0;~x~0 := 0; {913#false} is VALID [2018-11-18 22:56:42,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {913#false} assume true; {913#false} is VALID [2018-11-18 22:56:42,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {913#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {913#false} is VALID [2018-11-18 22:56:42,429 INFO L256 TraceCheckUtils]: 23: Hoare triple {913#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {913#false} is VALID [2018-11-18 22:56:42,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2018-11-18 22:56:42,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2018-11-18 22:56:42,430 INFO L273 TraceCheckUtils]: 26: Hoare triple {913#false} assume !false; {913#false} is VALID [2018-11-18 22:56:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:56:42,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:56:42,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:42,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:56:42,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:42,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:56:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:56:42,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:56:42,514 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 7 states. [2018-11-18 22:56:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:42,802 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-18 22:56:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:56:42,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-18 22:56:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:56:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-18 22:56:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:56:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-18 22:56:42,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-18 22:56:42,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:42,894 INFO L225 Difference]: With dead ends: 62 [2018-11-18 22:56:42,895 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 22:56:42,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:56:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 22:56:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-18 22:56:42,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:42,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-18 22:56:42,936 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-18 22:56:42,937 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-18 22:56:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:42,939 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 22:56:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-18 22:56:42,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:42,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:42,940 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-18 22:56:42,940 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-18 22:56:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:42,943 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 22:56:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-18 22:56:42,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:42,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:42,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:42,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:56:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-18 22:56:42,947 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 27 [2018-11-18 22:56:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:42,947 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-18 22:56:42,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:56:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 22:56:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 22:56:42,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:42,949 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:42,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:42,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -83930962, now seen corresponding path program 4 times [2018-11-18 22:56:42,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:42,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:42,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:42,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:43,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {1224#true} call ULTIMATE.init(); {1224#true} is VALID [2018-11-18 22:56:43,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {1224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1224#true} is VALID [2018-11-18 22:56:43,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1224#true} assume true; {1224#true} is VALID [2018-11-18 22:56:43,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} #73#return; {1224#true} is VALID [2018-11-18 22:56:43,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {1224#true} call #t~ret7 := main(); {1224#true} is VALID [2018-11-18 22:56:43,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {1224#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1226#(= main_~i~0 0)} is VALID [2018-11-18 22:56:43,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#(= main_~i~0 0)} assume true; {1226#(= main_~i~0 0)} is VALID [2018-11-18 22:56:43,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1226#(= main_~i~0 0)} is VALID [2018-11-18 22:56:43,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1226#(= main_~i~0 0)} is VALID [2018-11-18 22:56:43,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {1227#(<= main_~i~0 1)} assume true; {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {1227#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {1227#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {1227#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {1228#(<= main_~i~0 2)} assume true; {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {1228#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {1228#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {1228#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {1229#(<= main_~i~0 3)} assume true; {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {1229#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {1230#(<= main_~i~0 4)} assume true; {1230#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {1230#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1225#false} is VALID [2018-11-18 22:56:43,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {1225#false} havoc ~x~0;~x~0 := 0; {1225#false} is VALID [2018-11-18 22:56:43,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {1225#false} assume true; {1225#false} is VALID [2018-11-18 22:56:43,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {1225#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1225#false} is VALID [2018-11-18 22:56:43,140 INFO L256 TraceCheckUtils]: 27: Hoare triple {1225#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1225#false} is VALID [2018-11-18 22:56:43,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {1225#false} ~cond := #in~cond; {1225#false} is VALID [2018-11-18 22:56:43,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {1225#false} assume 0 == ~cond; {1225#false} is VALID [2018-11-18 22:56:43,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {1225#false} assume !false; {1225#false} is VALID [2018-11-18 22:56:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:43,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:43,144 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-18 22:56:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:56:43,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:56:43,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:43,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:43,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {1224#true} call ULTIMATE.init(); {1224#true} is VALID [2018-11-18 22:56:43,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {1224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1224#true} is VALID [2018-11-18 22:56:43,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {1224#true} assume true; {1224#true} is VALID [2018-11-18 22:56:43,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1224#true} {1224#true} #73#return; {1224#true} is VALID [2018-11-18 22:56:43,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {1224#true} call #t~ret7 := main(); {1224#true} is VALID [2018-11-18 22:56:43,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {1224#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1249#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {1249#(<= main_~i~0 0)} assume true; {1249#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {1249#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1249#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {1249#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1249#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:43,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {1249#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {1227#(<= main_~i~0 1)} assume true; {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {1227#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {1227#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1227#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:43,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {1227#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {1228#(<= main_~i~0 2)} assume true; {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {1228#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {1228#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1228#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:43,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {1228#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,512 INFO L273 TraceCheckUtils]: 18: Hoare triple {1229#(<= main_~i~0 3)} assume true; {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,522 INFO L273 TraceCheckUtils]: 19: Hoare triple {1229#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {1229#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1229#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:43,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {1229#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1230#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,529 INFO L273 TraceCheckUtils]: 22: Hoare triple {1230#(<= main_~i~0 4)} assume true; {1230#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:43,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {1230#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1225#false} is VALID [2018-11-18 22:56:43,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {1225#false} havoc ~x~0;~x~0 := 0; {1225#false} is VALID [2018-11-18 22:56:43,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {1225#false} assume true; {1225#false} is VALID [2018-11-18 22:56:43,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {1225#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1225#false} is VALID [2018-11-18 22:56:43,530 INFO L256 TraceCheckUtils]: 27: Hoare triple {1225#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1225#false} is VALID [2018-11-18 22:56:43,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {1225#false} ~cond := #in~cond; {1225#false} is VALID [2018-11-18 22:56:43,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {1225#false} assume 0 == ~cond; {1225#false} is VALID [2018-11-18 22:56:43,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {1225#false} assume !false; {1225#false} is VALID [2018-11-18 22:56:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:43,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:43,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:56:43,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 22:56:43,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:43,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:56:43,592 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-18 22:56:43,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:56:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:56:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:56:43,593 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 8 states. [2018-11-18 22:56:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:43,837 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-18 22:56:43,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:56:43,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 22:56:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:56:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-18 22:56:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:56:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-18 22:56:43,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-18 22:56:43,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:43,927 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:56:43,927 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 22:56:43,928 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 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-18 22:56:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 22:56:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 22:56:43,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:43,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-18 22:56:43,945 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-18 22:56:43,945 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-18 22:56:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:43,949 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-18 22:56:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-18 22:56:43,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:43,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:43,950 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-18 22:56:43,950 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-18 22:56:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:43,953 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-18 22:56:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-18 22:56:43,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:43,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:43,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:43,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 22:56:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 22:56:43,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 31 [2018-11-18 22:56:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:43,957 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 22:56:43,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:56:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 22:56:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 22:56:43,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:43,958 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:43,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:43,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:43,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2041183429, now seen corresponding path program 5 times [2018-11-18 22:56:43,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:43,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:44,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {1567#true} call ULTIMATE.init(); {1567#true} is VALID [2018-11-18 22:56:44,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1567#true} is VALID [2018-11-18 22:56:44,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-18 22:56:44,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} #73#return; {1567#true} is VALID [2018-11-18 22:56:44,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {1567#true} call #t~ret7 := main(); {1567#true} is VALID [2018-11-18 22:56:44,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {1567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1569#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {1569#(= main_~i~0 0)} assume true; {1569#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {1569#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1569#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {1569#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1569#(= main_~i~0 0)} is VALID [2018-11-18 22:56:44,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {1569#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(<= main_~i~0 1)} assume true; {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(<= main_~i~0 2)} assume true; {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(<= main_~i~0 3)} assume true; {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {1572#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {1572#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(<= main_~i~0 4)} assume true; {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,137 INFO L273 TraceCheckUtils]: 24: Hoare triple {1573#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {1573#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {1574#(<= main_~i~0 5)} assume true; {1574#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,146 INFO L273 TraceCheckUtils]: 27: Hoare triple {1574#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1568#false} is VALID [2018-11-18 22:56:44,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {1568#false} havoc ~x~0;~x~0 := 0; {1568#false} is VALID [2018-11-18 22:56:44,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {1568#false} assume true; {1568#false} is VALID [2018-11-18 22:56:44,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {1568#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1568#false} is VALID [2018-11-18 22:56:44,147 INFO L256 TraceCheckUtils]: 31: Hoare triple {1568#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1568#false} is VALID [2018-11-18 22:56:44,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {1568#false} ~cond := #in~cond; {1568#false} is VALID [2018-11-18 22:56:44,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {1568#false} assume 0 == ~cond; {1568#false} is VALID [2018-11-18 22:56:44,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {1568#false} assume !false; {1568#false} is VALID [2018-11-18 22:56:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:44,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:44,151 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-18 22:56:44,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:44,247 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:56:44,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:44,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:44,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {1567#true} call ULTIMATE.init(); {1567#true} is VALID [2018-11-18 22:56:44,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1567#true} is VALID [2018-11-18 22:56:44,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-18 22:56:44,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} #73#return; {1567#true} is VALID [2018-11-18 22:56:44,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {1567#true} call #t~ret7 := main(); {1567#true} is VALID [2018-11-18 22:56:44,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {1567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1593#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:44,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {1593#(<= main_~i~0 0)} assume true; {1593#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:44,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {1593#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1593#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:44,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {1593#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1593#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:44,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {1593#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(<= main_~i~0 1)} assume true; {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {1570#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {1570#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1570#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:44,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {1570#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(<= main_~i~0 2)} assume true; {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1571#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:44,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {1572#(<= main_~i~0 3)} assume true; {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {1572#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {1572#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1572#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:44,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {1572#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {1573#(<= main_~i~0 4)} assume true; {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {1573#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {1573#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1573#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:44,530 INFO L273 TraceCheckUtils]: 25: Hoare triple {1573#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {1574#(<= main_~i~0 5)} assume true; {1574#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:44,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {1574#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1568#false} is VALID [2018-11-18 22:56:44,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {1568#false} havoc ~x~0;~x~0 := 0; {1568#false} is VALID [2018-11-18 22:56:44,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {1568#false} assume true; {1568#false} is VALID [2018-11-18 22:56:44,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {1568#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1568#false} is VALID [2018-11-18 22:56:44,532 INFO L256 TraceCheckUtils]: 31: Hoare triple {1568#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1568#false} is VALID [2018-11-18 22:56:44,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {1568#false} ~cond := #in~cond; {1568#false} is VALID [2018-11-18 22:56:44,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {1568#false} assume 0 == ~cond; {1568#false} is VALID [2018-11-18 22:56:44,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {1568#false} assume !false; {1568#false} is VALID [2018-11-18 22:56:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:44,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:44,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:56:44,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 22:56:44,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:44,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:56:44,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:44,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:56:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:56:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:56:44,600 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-18 22:56:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,049 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-18 22:56:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:56:45,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 22:56:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:56:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-18 22:56:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:56:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-18 22:56:45,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2018-11-18 22:56:45,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:45,306 INFO L225 Difference]: With dead ends: 70 [2018-11-18 22:56:45,306 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 22:56:45,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:56:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 22:56:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-18 22:56:45,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:45,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-18 22:56:45,348 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-18 22:56:45,348 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-18 22:56:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,351 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 22:56:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 22:56:45,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:45,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:45,351 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-18 22:56:45,352 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-18 22:56:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:45,354 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 22:56:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 22:56:45,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:45,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:45,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:45,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 22:56:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-18 22:56:45,357 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 35 [2018-11-18 22:56:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:45,358 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-18 22:56:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:56:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-18 22:56:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 22:56:45,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:45,359 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:45,359 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:45,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 207799644, now seen corresponding path program 6 times [2018-11-18 22:56:45,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:45,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:45,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:45,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:45,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:45,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2018-11-18 22:56:45,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1941#true} is VALID [2018-11-18 22:56:45,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {1941#true} assume true; {1941#true} is VALID [2018-11-18 22:56:45,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1941#true} {1941#true} #73#return; {1941#true} is VALID [2018-11-18 22:56:45,587 INFO L256 TraceCheckUtils]: 4: Hoare triple {1941#true} call #t~ret7 := main(); {1941#true} is VALID [2018-11-18 22:56:45,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1943#(= main_~i~0 0)} is VALID [2018-11-18 22:56:45,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {1943#(= main_~i~0 0)} assume true; {1943#(= main_~i~0 0)} is VALID [2018-11-18 22:56:45,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {1943#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1943#(= main_~i~0 0)} is VALID [2018-11-18 22:56:45,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {1943#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1943#(= main_~i~0 0)} is VALID [2018-11-18 22:56:45,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {1943#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {1944#(<= main_~i~0 1)} assume true; {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {1944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {1944#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {1944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {1945#(<= main_~i~0 2)} assume true; {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {1945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:45,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 3)} assume true; {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {1946#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:45,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {1946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {1947#(<= main_~i~0 4)} assume true; {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {1947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {1947#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:45,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {1947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {1948#(<= main_~i~0 5)} assume true; {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {1948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {1948#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:45,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {1948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1949#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#(<= main_~i~0 6)} assume true; {1949#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1942#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 32: Hoare triple {1942#false} havoc ~x~0;~x~0 := 0; {1942#false} is VALID [2018-11-18 22:56:45,609 INFO L273 TraceCheckUtils]: 33: Hoare triple {1942#false} assume true; {1942#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 34: Hoare triple {1942#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1942#false} is VALID [2018-11-18 22:56:45,610 INFO L256 TraceCheckUtils]: 35: Hoare triple {1942#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1942#false} is VALID [2018-11-18 22:56:45,610 INFO L273 TraceCheckUtils]: 36: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2018-11-18 22:56:45,611 INFO L273 TraceCheckUtils]: 38: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2018-11-18 22:56:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:45,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:45,614 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-18 22:56:45,624 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:45,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:56:45,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:45,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:46,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {1941#true} call ULTIMATE.init(); {1941#true} is VALID [2018-11-18 22:56:46,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1941#true} is VALID [2018-11-18 22:56:46,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {1941#true} assume true; {1941#true} is VALID [2018-11-18 22:56:46,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1941#true} {1941#true} #73#return; {1941#true} is VALID [2018-11-18 22:56:46,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {1941#true} call #t~ret7 := main(); {1941#true} is VALID [2018-11-18 22:56:46,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1968#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {1968#(<= main_~i~0 0)} assume true; {1968#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {1968#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1968#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {1968#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1968#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:46,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {1968#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {1944#(<= main_~i~0 1)} assume true; {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {1944#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {1944#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1944#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:46,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {1944#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {1945#(<= main_~i~0 2)} assume true; {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {1945#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1945#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:46,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 3)} assume true; {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {1946#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1946#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:46,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {1946#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {1947#(<= main_~i~0 4)} assume true; {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {1947#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {1947#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1947#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:46,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {1947#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {1948#(<= main_~i~0 5)} assume true; {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {1948#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {1948#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1948#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:46,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {1948#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1949#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {1949#(<= main_~i~0 6)} assume true; {1949#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:46,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {1949#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1942#false} is VALID [2018-11-18 22:56:46,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {1942#false} havoc ~x~0;~x~0 := 0; {1942#false} is VALID [2018-11-18 22:56:46,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {1942#false} assume true; {1942#false} is VALID [2018-11-18 22:56:46,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {1942#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1942#false} is VALID [2018-11-18 22:56:46,134 INFO L256 TraceCheckUtils]: 35: Hoare triple {1942#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1942#false} is VALID [2018-11-18 22:56:46,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {1942#false} ~cond := #in~cond; {1942#false} is VALID [2018-11-18 22:56:46,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {1942#false} assume 0 == ~cond; {1942#false} is VALID [2018-11-18 22:56:46,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2018-11-18 22:56:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:46,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:46,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:56:46,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 22:56:46,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:46,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:56:46,215 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-18 22:56:46,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:56:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:56:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:56:46,216 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 10 states. [2018-11-18 22:56:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:46,725 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2018-11-18 22:56:46,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:56:46,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-11-18 22:56:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:56:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2018-11-18 22:56:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:56:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2018-11-18 22:56:46,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 88 transitions. [2018-11-18 22:56:46,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:46,832 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:56:46,832 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 22:56:46,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:56:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 22:56:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-18 22:56:46,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:46,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-18 22:56:46,889 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-18 22:56:46,889 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-18 22:56:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:46,892 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-18 22:56:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-18 22:56:46,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:46,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:46,892 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-18 22:56:46,893 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-18 22:56:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:46,895 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-18 22:56:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-18 22:56:46,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:46,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:46,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:46,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 22:56:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-18 22:56:46,898 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 39 [2018-11-18 22:56:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:46,898 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-18 22:56:46,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:56:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-18 22:56:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 22:56:46,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:46,899 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:46,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:46,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:46,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1916310925, now seen corresponding path program 7 times [2018-11-18 22:56:46,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:46,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:46,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:47,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {2346#true} call ULTIMATE.init(); {2346#true} is VALID [2018-11-18 22:56:47,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {2346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2346#true} is VALID [2018-11-18 22:56:47,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {2346#true} assume true; {2346#true} is VALID [2018-11-18 22:56:47,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2346#true} {2346#true} #73#return; {2346#true} is VALID [2018-11-18 22:56:47,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {2346#true} call #t~ret7 := main(); {2346#true} is VALID [2018-11-18 22:56:47,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {2346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2348#(= main_~i~0 0)} is VALID [2018-11-18 22:56:47,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {2348#(= main_~i~0 0)} assume true; {2348#(= main_~i~0 0)} is VALID [2018-11-18 22:56:47,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {2348#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2348#(= main_~i~0 0)} is VALID [2018-11-18 22:56:47,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {2348#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2348#(= main_~i~0 0)} is VALID [2018-11-18 22:56:47,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {2348#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {2349#(<= main_~i~0 1)} assume true; {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {2349#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {2349#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {2349#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {2350#(<= main_~i~0 2)} assume true; {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {2350#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {2351#(<= main_~i~0 3)} assume true; {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {2351#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {2351#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {2351#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {2352#(<= main_~i~0 4)} assume true; {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {2352#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {2352#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {2352#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {2353#(<= main_~i~0 5)} assume true; {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {2353#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {2353#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {2353#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {2354#(<= main_~i~0 6)} assume true; {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {2354#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {2354#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {2354#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2355#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:47,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {2355#(<= main_~i~0 7)} assume true; {2355#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:47,279 INFO L273 TraceCheckUtils]: 35: Hoare triple {2355#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2347#false} is VALID [2018-11-18 22:56:47,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {2347#false} havoc ~x~0;~x~0 := 0; {2347#false} is VALID [2018-11-18 22:56:47,279 INFO L273 TraceCheckUtils]: 37: Hoare triple {2347#false} assume true; {2347#false} is VALID [2018-11-18 22:56:47,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {2347#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2347#false} is VALID [2018-11-18 22:56:47,279 INFO L256 TraceCheckUtils]: 39: Hoare triple {2347#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2347#false} is VALID [2018-11-18 22:56:47,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {2347#false} ~cond := #in~cond; {2347#false} is VALID [2018-11-18 22:56:47,280 INFO L273 TraceCheckUtils]: 41: Hoare triple {2347#false} assume 0 == ~cond; {2347#false} is VALID [2018-11-18 22:56:47,280 INFO L273 TraceCheckUtils]: 42: Hoare triple {2347#false} assume !false; {2347#false} is VALID [2018-11-18 22:56:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:47,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:47,283 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-18 22:56:47,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:47,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:47,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {2346#true} call ULTIMATE.init(); {2346#true} is VALID [2018-11-18 22:56:47,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {2346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2346#true} is VALID [2018-11-18 22:56:47,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {2346#true} assume true; {2346#true} is VALID [2018-11-18 22:56:47,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2346#true} {2346#true} #73#return; {2346#true} is VALID [2018-11-18 22:56:47,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {2346#true} call #t~ret7 := main(); {2346#true} is VALID [2018-11-18 22:56:47,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {2346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2374#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:47,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {2374#(<= main_~i~0 0)} assume true; {2374#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:47,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {2374#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2374#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:47,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {2374#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2374#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:47,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {2374#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {2349#(<= main_~i~0 1)} assume true; {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {2349#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {2349#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2349#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:47,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {2349#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {2350#(<= main_~i~0 2)} assume true; {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {2350#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2350#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:47,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,465 INFO L273 TraceCheckUtils]: 18: Hoare triple {2351#(<= main_~i~0 3)} assume true; {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,465 INFO L273 TraceCheckUtils]: 19: Hoare triple {2351#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {2351#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2351#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:47,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {2351#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {2352#(<= main_~i~0 4)} assume true; {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {2352#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {2352#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2352#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:47,469 INFO L273 TraceCheckUtils]: 25: Hoare triple {2352#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {2353#(<= main_~i~0 5)} assume true; {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {2353#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {2353#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2353#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:47,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {2353#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,472 INFO L273 TraceCheckUtils]: 30: Hoare triple {2354#(<= main_~i~0 6)} assume true; {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,472 INFO L273 TraceCheckUtils]: 31: Hoare triple {2354#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,473 INFO L273 TraceCheckUtils]: 32: Hoare triple {2354#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2354#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:47,473 INFO L273 TraceCheckUtils]: 33: Hoare triple {2354#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2355#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:47,474 INFO L273 TraceCheckUtils]: 34: Hoare triple {2355#(<= main_~i~0 7)} assume true; {2355#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:47,475 INFO L273 TraceCheckUtils]: 35: Hoare triple {2355#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2347#false} is VALID [2018-11-18 22:56:47,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {2347#false} havoc ~x~0;~x~0 := 0; {2347#false} is VALID [2018-11-18 22:56:47,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {2347#false} assume true; {2347#false} is VALID [2018-11-18 22:56:47,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {2347#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2347#false} is VALID [2018-11-18 22:56:47,475 INFO L256 TraceCheckUtils]: 39: Hoare triple {2347#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2347#false} is VALID [2018-11-18 22:56:47,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {2347#false} ~cond := #in~cond; {2347#false} is VALID [2018-11-18 22:56:47,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {2347#false} assume 0 == ~cond; {2347#false} is VALID [2018-11-18 22:56:47,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {2347#false} assume !false; {2347#false} is VALID [2018-11-18 22:56:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:47,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:47,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:56:47,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 22:56:47,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:47,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:56:47,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:47,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:56:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:56:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:56:47,543 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 11 states. [2018-11-18 22:56:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:47,952 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-18 22:56:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:56:47,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 22:56:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:56:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2018-11-18 22:56:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:56:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2018-11-18 22:56:47,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2018-11-18 22:56:48,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:48,055 INFO L225 Difference]: With dead ends: 78 [2018-11-18 22:56:48,056 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 22:56:48,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:56:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 22:56:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 22:56:48,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:48,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-18 22:56:48,074 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-18 22:56:48,074 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-18 22:56:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:48,076 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-18 22:56:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-18 22:56:48,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:48,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:48,077 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-18 22:56:48,077 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-18 22:56:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:48,079 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-18 22:56:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-18 22:56:48,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:48,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:48,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:48,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 22:56:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-18 22:56:48,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 43 [2018-11-18 22:56:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:48,082 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-18 22:56:48,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:56:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-18 22:56:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 22:56:48,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:48,083 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:48,083 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:48,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash -745165814, now seen corresponding path program 8 times [2018-11-18 22:56:48,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:48,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:48,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:48,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {2782#true} call ULTIMATE.init(); {2782#true} is VALID [2018-11-18 22:56:48,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {2782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2782#true} is VALID [2018-11-18 22:56:48,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {2782#true} assume true; {2782#true} is VALID [2018-11-18 22:56:48,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2782#true} {2782#true} #73#return; {2782#true} is VALID [2018-11-18 22:56:48,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {2782#true} call #t~ret7 := main(); {2782#true} is VALID [2018-11-18 22:56:48,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {2782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2784#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {2784#(= main_~i~0 0)} assume true; {2784#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {2784#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2784#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {2784#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2784#(= main_~i~0 0)} is VALID [2018-11-18 22:56:48,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {2784#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {2785#(<= main_~i~0 1)} assume true; {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {2785#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {2786#(<= main_~i~0 2)} assume true; {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 3)} assume true; {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {2787#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {2787#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {2788#(<= main_~i~0 4)} assume true; {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {2788#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {2788#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {2788#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {2789#(<= main_~i~0 5)} assume true; {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,271 INFO L273 TraceCheckUtils]: 27: Hoare triple {2789#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {2789#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {2789#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,273 INFO L273 TraceCheckUtils]: 30: Hoare triple {2790#(<= main_~i~0 6)} assume true; {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,274 INFO L273 TraceCheckUtils]: 31: Hoare triple {2790#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {2790#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {2790#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {2791#(<= main_~i~0 7)} assume true; {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {2791#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {2791#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {2791#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2792#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {2792#(<= main_~i~0 8)} assume true; {2792#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {2792#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2783#false} is VALID [2018-11-18 22:56:48,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {2783#false} havoc ~x~0;~x~0 := 0; {2783#false} is VALID [2018-11-18 22:56:48,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {2783#false} assume true; {2783#false} is VALID [2018-11-18 22:56:48,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {2783#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2783#false} is VALID [2018-11-18 22:56:48,279 INFO L256 TraceCheckUtils]: 43: Hoare triple {2783#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2783#false} is VALID [2018-11-18 22:56:48,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {2783#false} ~cond := #in~cond; {2783#false} is VALID [2018-11-18 22:56:48,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {2783#false} assume 0 == ~cond; {2783#false} is VALID [2018-11-18 22:56:48,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {2783#false} assume !false; {2783#false} is VALID [2018-11-18 22:56:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:48,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:48,282 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-18 22:56:48,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:48,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:48,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:48,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:48,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {2782#true} call ULTIMATE.init(); {2782#true} is VALID [2018-11-18 22:56:48,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {2782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2782#true} is VALID [2018-11-18 22:56:48,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {2782#true} assume true; {2782#true} is VALID [2018-11-18 22:56:48,482 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2782#true} {2782#true} #73#return; {2782#true} is VALID [2018-11-18 22:56:48,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {2782#true} call #t~ret7 := main(); {2782#true} is VALID [2018-11-18 22:56:48,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {2782#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2811#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {2811#(<= main_~i~0 0)} assume true; {2811#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {2811#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2811#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {2811#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2811#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:48,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {2811#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {2785#(<= main_~i~0 1)} assume true; {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2785#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:48,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {2785#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {2786#(<= main_~i~0 2)} assume true; {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {2786#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2786#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:48,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {2786#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {2787#(<= main_~i~0 3)} assume true; {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {2787#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {2787#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2787#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:48,504 INFO L273 TraceCheckUtils]: 21: Hoare triple {2787#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {2788#(<= main_~i~0 4)} assume true; {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,505 INFO L273 TraceCheckUtils]: 23: Hoare triple {2788#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,506 INFO L273 TraceCheckUtils]: 24: Hoare triple {2788#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2788#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:48,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {2788#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,507 INFO L273 TraceCheckUtils]: 26: Hoare triple {2789#(<= main_~i~0 5)} assume true; {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,508 INFO L273 TraceCheckUtils]: 27: Hoare triple {2789#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {2789#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2789#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:48,509 INFO L273 TraceCheckUtils]: 29: Hoare triple {2789#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,509 INFO L273 TraceCheckUtils]: 30: Hoare triple {2790#(<= main_~i~0 6)} assume true; {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {2790#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {2790#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2790#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:48,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {2790#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {2791#(<= main_~i~0 7)} assume true; {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {2791#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,513 INFO L273 TraceCheckUtils]: 36: Hoare triple {2791#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2791#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:48,513 INFO L273 TraceCheckUtils]: 37: Hoare triple {2791#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2792#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {2792#(<= main_~i~0 8)} assume true; {2792#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:48,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {2792#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2783#false} is VALID [2018-11-18 22:56:48,515 INFO L273 TraceCheckUtils]: 40: Hoare triple {2783#false} havoc ~x~0;~x~0 := 0; {2783#false} is VALID [2018-11-18 22:56:48,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {2783#false} assume true; {2783#false} is VALID [2018-11-18 22:56:48,515 INFO L273 TraceCheckUtils]: 42: Hoare triple {2783#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2783#false} is VALID [2018-11-18 22:56:48,515 INFO L256 TraceCheckUtils]: 43: Hoare triple {2783#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2783#false} is VALID [2018-11-18 22:56:48,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {2783#false} ~cond := #in~cond; {2783#false} is VALID [2018-11-18 22:56:48,516 INFO L273 TraceCheckUtils]: 45: Hoare triple {2783#false} assume 0 == ~cond; {2783#false} is VALID [2018-11-18 22:56:48,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {2783#false} assume !false; {2783#false} is VALID [2018-11-18 22:56:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:48,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:48,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:56:48,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:56:48,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:48,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:56:48,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:48,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:56:48,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:56:48,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:56:48,593 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 12 states. [2018-11-18 22:56:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:49,103 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-11-18 22:56:49,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:56:49,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-11-18 22:56:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:56:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2018-11-18 22:56:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:56:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2018-11-18 22:56:49,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2018-11-18 22:56:49,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:49,274 INFO L225 Difference]: With dead ends: 82 [2018-11-18 22:56:49,274 INFO L226 Difference]: Without dead ends: 64 [2018-11-18 22:56:49,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:56:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-18 22:56:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-18 22:56:49,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:49,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-18 22:56:49,298 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-18 22:56:49,298 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-18 22:56:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:49,303 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-18 22:56:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-18 22:56:49,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:49,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:49,303 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-18 22:56:49,304 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-18 22:56:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:49,305 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-18 22:56:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-18 22:56:49,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:49,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:49,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:49,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 22:56:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2018-11-18 22:56:49,308 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 47 [2018-11-18 22:56:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:49,308 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2018-11-18 22:56:49,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:56:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-18 22:56:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 22:56:49,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:49,309 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:49,310 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:49,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash 514542113, now seen corresponding path program 9 times [2018-11-18 22:56:49,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:49,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:49,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:49,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:49,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {3249#true} call ULTIMATE.init(); {3249#true} is VALID [2018-11-18 22:56:49,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {3249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3249#true} is VALID [2018-11-18 22:56:49,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {3249#true} assume true; {3249#true} is VALID [2018-11-18 22:56:49,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3249#true} {3249#true} #73#return; {3249#true} is VALID [2018-11-18 22:56:49,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {3249#true} call #t~ret7 := main(); {3249#true} is VALID [2018-11-18 22:56:49,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {3249#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3251#(= main_~i~0 0)} is VALID [2018-11-18 22:56:49,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {3251#(= main_~i~0 0)} assume true; {3251#(= main_~i~0 0)} is VALID [2018-11-18 22:56:49,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {3251#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3251#(= main_~i~0 0)} is VALID [2018-11-18 22:56:49,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {3251#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3251#(= main_~i~0 0)} is VALID [2018-11-18 22:56:49,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {3251#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {3252#(<= main_~i~0 1)} assume true; {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {3252#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {3252#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {3252#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {3253#(<= main_~i~0 2)} assume true; {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {3253#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,555 INFO L273 TraceCheckUtils]: 16: Hoare triple {3253#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,556 INFO L273 TraceCheckUtils]: 17: Hoare triple {3253#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,557 INFO L273 TraceCheckUtils]: 18: Hoare triple {3254#(<= main_~i~0 3)} assume true; {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,557 INFO L273 TraceCheckUtils]: 19: Hoare triple {3254#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {3254#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,558 INFO L273 TraceCheckUtils]: 21: Hoare triple {3254#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(<= main_~i~0 4)} assume true; {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {3255#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {3255#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {3255#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {3256#(<= main_~i~0 5)} assume true; {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {3256#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,562 INFO L273 TraceCheckUtils]: 28: Hoare triple {3256#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {3256#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {3257#(<= main_~i~0 6)} assume true; {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {3257#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,565 INFO L273 TraceCheckUtils]: 32: Hoare triple {3257#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,565 INFO L273 TraceCheckUtils]: 33: Hoare triple {3257#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {3258#(<= main_~i~0 7)} assume true; {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,566 INFO L273 TraceCheckUtils]: 35: Hoare triple {3258#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {3258#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {3258#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,568 INFO L273 TraceCheckUtils]: 38: Hoare triple {3259#(<= main_~i~0 8)} assume true; {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,569 INFO L273 TraceCheckUtils]: 39: Hoare triple {3259#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,569 INFO L273 TraceCheckUtils]: 40: Hoare triple {3259#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,570 INFO L273 TraceCheckUtils]: 41: Hoare triple {3259#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3260#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:49,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {3260#(<= main_~i~0 9)} assume true; {3260#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:49,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {3260#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3250#false} is VALID [2018-11-18 22:56:49,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {3250#false} havoc ~x~0;~x~0 := 0; {3250#false} is VALID [2018-11-18 22:56:49,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {3250#false} assume true; {3250#false} is VALID [2018-11-18 22:56:49,572 INFO L273 TraceCheckUtils]: 46: Hoare triple {3250#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3250#false} is VALID [2018-11-18 22:56:49,572 INFO L256 TraceCheckUtils]: 47: Hoare triple {3250#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3250#false} is VALID [2018-11-18 22:56:49,572 INFO L273 TraceCheckUtils]: 48: Hoare triple {3250#false} ~cond := #in~cond; {3250#false} is VALID [2018-11-18 22:56:49,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {3250#false} assume 0 == ~cond; {3250#false} is VALID [2018-11-18 22:56:49,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {3250#false} assume !false; {3250#false} is VALID [2018-11-18 22:56:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:49,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:49,575 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-18 22:56:49,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:56:49,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:56:49,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:49,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:49,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {3249#true} call ULTIMATE.init(); {3249#true} is VALID [2018-11-18 22:56:49,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {3249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3249#true} is VALID [2018-11-18 22:56:49,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {3249#true} assume true; {3249#true} is VALID [2018-11-18 22:56:49,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3249#true} {3249#true} #73#return; {3249#true} is VALID [2018-11-18 22:56:49,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {3249#true} call #t~ret7 := main(); {3249#true} is VALID [2018-11-18 22:56:49,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {3249#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3279#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:49,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {3279#(<= main_~i~0 0)} assume true; {3279#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:49,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {3279#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3279#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:49,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {3279#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3279#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:49,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {3279#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {3252#(<= main_~i~0 1)} assume true; {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {3252#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {3252#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3252#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:49,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {3252#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {3253#(<= main_~i~0 2)} assume true; {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {3253#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {3253#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3253#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:49,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {3253#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {3254#(<= main_~i~0 3)} assume true; {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {3254#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {3254#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3254#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:49,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {3254#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(<= main_~i~0 4)} assume true; {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {3255#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {3255#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3255#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:49,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {3255#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,809 INFO L273 TraceCheckUtils]: 26: Hoare triple {3256#(<= main_~i~0 5)} assume true; {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {3256#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {3256#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3256#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:49,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {3256#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {3257#(<= main_~i~0 6)} assume true; {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {3257#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {3257#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3257#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:49,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {3257#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {3258#(<= main_~i~0 7)} assume true; {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {3258#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {3258#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3258#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:49,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {3258#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {3259#(<= main_~i~0 8)} assume true; {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,816 INFO L273 TraceCheckUtils]: 39: Hoare triple {3259#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {3259#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3259#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:49,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {3259#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3260#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:49,818 INFO L273 TraceCheckUtils]: 42: Hoare triple {3260#(<= main_~i~0 9)} assume true; {3260#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:49,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {3260#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3250#false} is VALID [2018-11-18 22:56:49,819 INFO L273 TraceCheckUtils]: 44: Hoare triple {3250#false} havoc ~x~0;~x~0 := 0; {3250#false} is VALID [2018-11-18 22:56:49,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {3250#false} assume true; {3250#false} is VALID [2018-11-18 22:56:49,820 INFO L273 TraceCheckUtils]: 46: Hoare triple {3250#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3250#false} is VALID [2018-11-18 22:56:49,820 INFO L256 TraceCheckUtils]: 47: Hoare triple {3250#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3250#false} is VALID [2018-11-18 22:56:49,820 INFO L273 TraceCheckUtils]: 48: Hoare triple {3250#false} ~cond := #in~cond; {3250#false} is VALID [2018-11-18 22:56:49,820 INFO L273 TraceCheckUtils]: 49: Hoare triple {3250#false} assume 0 == ~cond; {3250#false} is VALID [2018-11-18 22:56:49,820 INFO L273 TraceCheckUtils]: 50: Hoare triple {3250#false} assume !false; {3250#false} is VALID [2018-11-18 22:56:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:49,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:49,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:56:49,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-18 22:56:49,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:49,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:56:49,894 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-18 22:56:49,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:56:49,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:56:49,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:56:49,895 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 13 states. [2018-11-18 22:56:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:50,273 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2018-11-18 22:56:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:56:50,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2018-11-18 22:56:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:56:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-18 22:56:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:56:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 103 transitions. [2018-11-18 22:56:50,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 103 transitions. [2018-11-18 22:56:50,424 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-18 22:56:50,425 INFO L225 Difference]: With dead ends: 86 [2018-11-18 22:56:50,425 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 22:56:50,426 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:56:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 22:56:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-18 22:56:50,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:50,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-18 22:56:50,475 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-18 22:56:50,475 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-18 22:56:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:50,477 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-18 22:56:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-18 22:56:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:50,478 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-18 22:56:50,478 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-18 22:56:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:50,479 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-18 22:56:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-18 22:56:50,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:50,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:50,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:50,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 22:56:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-18 22:56:50,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 51 [2018-11-18 22:56:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:50,482 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-18 22:56:50,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:56:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-18 22:56:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 22:56:50,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:50,483 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:50,483 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:50,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1962539848, now seen corresponding path program 10 times [2018-11-18 22:56:50,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:50,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:50,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:50,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:50,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {3747#true} call ULTIMATE.init(); {3747#true} is VALID [2018-11-18 22:56:50,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {3747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3747#true} is VALID [2018-11-18 22:56:50,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {3747#true} assume true; {3747#true} is VALID [2018-11-18 22:56:50,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3747#true} {3747#true} #73#return; {3747#true} is VALID [2018-11-18 22:56:50,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {3747#true} call #t~ret7 := main(); {3747#true} is VALID [2018-11-18 22:56:50,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {3747#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3749#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {3749#(= main_~i~0 0)} assume true; {3749#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {3749#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3749#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {3749#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3749#(= main_~i~0 0)} is VALID [2018-11-18 22:56:50,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {3749#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {3750#(<= main_~i~0 1)} assume true; {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {3750#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {3750#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:50,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {3750#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {3751#(<= main_~i~0 2)} assume true; {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {3751#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {3751#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:50,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {3751#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {3752#(<= main_~i~0 3)} assume true; {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {3752#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,735 INFO L273 TraceCheckUtils]: 20: Hoare triple {3752#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:50,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {3752#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {3753#(<= main_~i~0 4)} assume true; {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {3753#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {3753#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:50,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {3753#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {3754#(<= main_~i~0 5)} assume true; {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {3754#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {3754#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:50,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {3754#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {3755#(<= main_~i~0 6)} assume true; {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {3755#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {3755#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:50,743 INFO L273 TraceCheckUtils]: 33: Hoare triple {3755#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,743 INFO L273 TraceCheckUtils]: 34: Hoare triple {3756#(<= main_~i~0 7)} assume true; {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,744 INFO L273 TraceCheckUtils]: 35: Hoare triple {3756#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {3756#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:50,745 INFO L273 TraceCheckUtils]: 37: Hoare triple {3756#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#(<= main_~i~0 8)} assume true; {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,746 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,746 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:50,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#(<= main_~i~0 9)} assume true; {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {3758#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:50,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3759#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {3759#(<= main_~i~0 10)} assume true; {3759#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:50,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {3759#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-18 22:56:50,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {3748#false} havoc ~x~0;~x~0 := 0; {3748#false} is VALID [2018-11-18 22:56:50,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {3748#false} assume true; {3748#false} is VALID [2018-11-18 22:56:50,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {3748#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3748#false} is VALID [2018-11-18 22:56:50,751 INFO L256 TraceCheckUtils]: 51: Hoare triple {3748#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3748#false} is VALID [2018-11-18 22:56:50,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {3748#false} ~cond := #in~cond; {3748#false} is VALID [2018-11-18 22:56:50,752 INFO L273 TraceCheckUtils]: 53: Hoare triple {3748#false} assume 0 == ~cond; {3748#false} is VALID [2018-11-18 22:56:50,752 INFO L273 TraceCheckUtils]: 54: Hoare triple {3748#false} assume !false; {3748#false} is VALID [2018-11-18 22:56:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:50,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:50,755 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-18 22:56:50,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:56:50,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:56:50,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:50,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:51,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {3747#true} call ULTIMATE.init(); {3747#true} is VALID [2018-11-18 22:56:51,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {3747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3747#true} is VALID [2018-11-18 22:56:51,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {3747#true} assume true; {3747#true} is VALID [2018-11-18 22:56:51,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3747#true} {3747#true} #73#return; {3747#true} is VALID [2018-11-18 22:56:51,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {3747#true} call #t~ret7 := main(); {3747#true} is VALID [2018-11-18 22:56:51,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {3747#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3778#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:51,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {3778#(<= main_~i~0 0)} assume true; {3778#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:51,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {3778#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3778#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:51,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {3778#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3778#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:51,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {3778#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:51,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {3750#(<= main_~i~0 1)} assume true; {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:51,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {3750#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:51,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {3750#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3750#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:51,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {3750#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:51,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {3751#(<= main_~i~0 2)} assume true; {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:51,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {3751#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:51,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {3751#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3751#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:51,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {3751#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:51,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {3752#(<= main_~i~0 3)} assume true; {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:51,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {3752#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:51,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {3752#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3752#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:51,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {3752#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:51,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {3753#(<= main_~i~0 4)} assume true; {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:51,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {3753#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:51,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {3753#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3753#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:51,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {3753#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:51,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {3754#(<= main_~i~0 5)} assume true; {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:51,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {3754#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:51,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {3754#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3754#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:51,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {3754#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:51,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {3755#(<= main_~i~0 6)} assume true; {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:51,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {3755#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:51,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {3755#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3755#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:51,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {3755#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:51,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {3756#(<= main_~i~0 7)} assume true; {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:51,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {3756#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:51,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {3756#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3756#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:51,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {3756#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:51,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#(<= main_~i~0 8)} assume true; {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:51,149 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:51,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3757#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:51,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:51,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#(<= main_~i~0 9)} assume true; {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:51,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:51,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {3758#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3758#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:51,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3759#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:51,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {3759#(<= main_~i~0 10)} assume true; {3759#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:51,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {3759#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3748#false} is VALID [2018-11-18 22:56:51,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {3748#false} havoc ~x~0;~x~0 := 0; {3748#false} is VALID [2018-11-18 22:56:51,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {3748#false} assume true; {3748#false} is VALID [2018-11-18 22:56:51,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {3748#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3748#false} is VALID [2018-11-18 22:56:51,155 INFO L256 TraceCheckUtils]: 51: Hoare triple {3748#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3748#false} is VALID [2018-11-18 22:56:51,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {3748#false} ~cond := #in~cond; {3748#false} is VALID [2018-11-18 22:56:51,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {3748#false} assume 0 == ~cond; {3748#false} is VALID [2018-11-18 22:56:51,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {3748#false} assume !false; {3748#false} is VALID [2018-11-18 22:56:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:51,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:56:51,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-18 22:56:51,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:51,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:56:51,256 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-18 22:56:51,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:56:51,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:56:51,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:56:51,257 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 14 states. [2018-11-18 22:56:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:51,618 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2018-11-18 22:56:51,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:56:51,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-18 22:56:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:56:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-18 22:56:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:56:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2018-11-18 22:56:51,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 108 transitions. [2018-11-18 22:56:51,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:51,735 INFO L225 Difference]: With dead ends: 90 [2018-11-18 22:56:51,735 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 22:56:51,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:56:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 22:56:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-18 22:56:51,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:51,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2018-11-18 22:56:51,763 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2018-11-18 22:56:51,764 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2018-11-18 22:56:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:51,765 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-18 22:56:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-18 22:56:51,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:51,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:51,766 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2018-11-18 22:56:51,766 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2018-11-18 22:56:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:51,768 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-18 22:56:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-18 22:56:51,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:51,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:51,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:51,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 22:56:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-11-18 22:56:51,771 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 55 [2018-11-18 22:56:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:51,772 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-11-18 22:56:51,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:56:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-18 22:56:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 22:56:51,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:51,773 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:51,773 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:51,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2143525839, now seen corresponding path program 11 times [2018-11-18 22:56:51,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:51,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:51,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:52,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2018-11-18 22:56:52,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {4276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4276#true} is VALID [2018-11-18 22:56:52,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2018-11-18 22:56:52,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #73#return; {4276#true} is VALID [2018-11-18 22:56:52,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret7 := main(); {4276#true} is VALID [2018-11-18 22:56:52,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4278#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {4278#(= main_~i~0 0)} assume true; {4278#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,285 INFO L273 TraceCheckUtils]: 7: Hoare triple {4278#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4278#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {4278#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4278#(= main_~i~0 0)} is VALID [2018-11-18 22:56:52,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {4278#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {4279#(<= main_~i~0 1)} assume true; {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {4279#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {4279#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {4280#(<= main_~i~0 2)} assume true; {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {4280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {4280#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {4280#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {4281#(<= main_~i~0 3)} assume true; {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {4281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {4281#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {4281#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,398 INFO L273 TraceCheckUtils]: 22: Hoare triple {4282#(<= main_~i~0 4)} assume true; {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {4282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {4282#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {4282#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {4283#(<= main_~i~0 5)} assume true; {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {4283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {4283#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {4283#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {4284#(<= main_~i~0 6)} assume true; {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {4284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {4284#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {4284#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {4285#(<= main_~i~0 7)} assume true; {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {4285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {4285#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {4285#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {4286#(<= main_~i~0 8)} assume true; {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {4286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {4286#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {4286#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {4287#(<= main_~i~0 9)} assume true; {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {4287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {4287#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {4287#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {4288#(<= main_~i~0 10)} assume true; {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,414 INFO L273 TraceCheckUtils]: 47: Hoare triple {4288#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,414 INFO L273 TraceCheckUtils]: 48: Hoare triple {4288#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {4288#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4289#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {4289#(<= main_~i~0 11)} assume true; {4289#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4277#false} is VALID [2018-11-18 22:56:52,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {4277#false} havoc ~x~0;~x~0 := 0; {4277#false} is VALID [2018-11-18 22:56:52,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {4277#false} assume true; {4277#false} is VALID [2018-11-18 22:56:52,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {4277#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4277#false} is VALID [2018-11-18 22:56:52,418 INFO L256 TraceCheckUtils]: 55: Hoare triple {4277#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4277#false} is VALID [2018-11-18 22:56:52,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {4277#false} ~cond := #in~cond; {4277#false} is VALID [2018-11-18 22:56:52,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {4277#false} assume 0 == ~cond; {4277#false} is VALID [2018-11-18 22:56:52,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2018-11-18 22:56:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:52,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:52,424 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-18 22:56:52,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:56:52,526 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:56:52,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:52,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:52,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {4276#true} call ULTIMATE.init(); {4276#true} is VALID [2018-11-18 22:56:52,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {4276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4276#true} is VALID [2018-11-18 22:56:52,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {4276#true} assume true; {4276#true} is VALID [2018-11-18 22:56:52,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4276#true} {4276#true} #73#return; {4276#true} is VALID [2018-11-18 22:56:52,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {4276#true} call #t~ret7 := main(); {4276#true} is VALID [2018-11-18 22:56:52,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {4276#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4308#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {4308#(<= main_~i~0 0)} assume true; {4308#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {4308#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4308#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {4308#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4308#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:52,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {4308#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {4279#(<= main_~i~0 1)} assume true; {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {4279#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {4279#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4279#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:52,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {4279#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {4280#(<= main_~i~0 2)} assume true; {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {4280#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,693 INFO L273 TraceCheckUtils]: 16: Hoare triple {4280#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4280#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:52,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {4280#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {4281#(<= main_~i~0 3)} assume true; {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {4281#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {4281#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4281#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:52,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {4281#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {4282#(<= main_~i~0 4)} assume true; {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {4282#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {4282#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4282#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:52,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {4282#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {4283#(<= main_~i~0 5)} assume true; {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {4283#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {4283#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4283#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:52,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {4283#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {4284#(<= main_~i~0 6)} assume true; {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {4284#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {4284#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4284#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:52,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {4284#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,704 INFO L273 TraceCheckUtils]: 34: Hoare triple {4285#(<= main_~i~0 7)} assume true; {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {4285#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,706 INFO L273 TraceCheckUtils]: 36: Hoare triple {4285#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4285#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:52,706 INFO L273 TraceCheckUtils]: 37: Hoare triple {4285#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {4286#(<= main_~i~0 8)} assume true; {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,708 INFO L273 TraceCheckUtils]: 39: Hoare triple {4286#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {4286#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4286#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:52,709 INFO L273 TraceCheckUtils]: 41: Hoare triple {4286#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,710 INFO L273 TraceCheckUtils]: 42: Hoare triple {4287#(<= main_~i~0 9)} assume true; {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,710 INFO L273 TraceCheckUtils]: 43: Hoare triple {4287#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {4287#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4287#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:52,711 INFO L273 TraceCheckUtils]: 45: Hoare triple {4287#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {4288#(<= main_~i~0 10)} assume true; {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,713 INFO L273 TraceCheckUtils]: 47: Hoare triple {4288#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {4288#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4288#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:52,714 INFO L273 TraceCheckUtils]: 49: Hoare triple {4288#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4289#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,715 INFO L273 TraceCheckUtils]: 50: Hoare triple {4289#(<= main_~i~0 11)} assume true; {4289#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:52,715 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4277#false} is VALID [2018-11-18 22:56:52,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {4277#false} havoc ~x~0;~x~0 := 0; {4277#false} is VALID [2018-11-18 22:56:52,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {4277#false} assume true; {4277#false} is VALID [2018-11-18 22:56:52,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {4277#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4277#false} is VALID [2018-11-18 22:56:52,716 INFO L256 TraceCheckUtils]: 55: Hoare triple {4277#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4277#false} is VALID [2018-11-18 22:56:52,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {4277#false} ~cond := #in~cond; {4277#false} is VALID [2018-11-18 22:56:52,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {4277#false} assume 0 == ~cond; {4277#false} is VALID [2018-11-18 22:56:52,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {4277#false} assume !false; {4277#false} is VALID [2018-11-18 22:56:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:52,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:56:52,745 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-18 22:56:52,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:52,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:56:52,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:52,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:56:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:56:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:56:52,830 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2018-11-18 22:56:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:53,199 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2018-11-18 22:56:53,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:56:53,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-11-18 22:56:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:56:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-18 22:56:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:56:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-18 22:56:53,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2018-11-18 22:56:53,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:53,624 INFO L225 Difference]: With dead ends: 94 [2018-11-18 22:56:53,624 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 22:56:53,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:56:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 22:56:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-18 22:56:54,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:54,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-18 22:56:54,009 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-18 22:56:54,009 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-18 22:56:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:54,011 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-18 22:56:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2018-11-18 22:56:54,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:54,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:54,012 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-18 22:56:54,013 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-18 22:56:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:54,016 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-18 22:56:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2018-11-18 22:56:54,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:54,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:54,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:54,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 22:56:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-18 22:56:54,018 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 59 [2018-11-18 22:56:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:54,019 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-18 22:56:54,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:56:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-18 22:56:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 22:56:54,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:54,020 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:54,020 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:54,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 522309478, now seen corresponding path program 12 times [2018-11-18 22:56:54,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:54,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:55,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4836#true} is VALID [2018-11-18 22:56:55,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {4836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4836#true} is VALID [2018-11-18 22:56:55,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2018-11-18 22:56:55,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #73#return; {4836#true} is VALID [2018-11-18 22:56:55,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2018-11-18 22:56:55,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {4836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4838#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {4838#(= main_~i~0 0)} assume true; {4838#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {4838#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4838#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {4838#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4838#(= main_~i~0 0)} is VALID [2018-11-18 22:56:55,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {4838#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {4839#(<= main_~i~0 1)} assume true; {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {4839#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {4839#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {4839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {4840#(<= main_~i~0 2)} assume true; {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {4840#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {4840#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {4841#(<= main_~i~0 3)} assume true; {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {4841#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {4841#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {4841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {4842#(<= main_~i~0 4)} assume true; {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {4842#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,052 INFO L273 TraceCheckUtils]: 25: Hoare triple {4842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {4843#(<= main_~i~0 5)} assume true; {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {4843#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {4843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {4844#(<= main_~i~0 6)} assume true; {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {4844#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {4844#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {4844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(<= main_~i~0 7)} assume true; {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {4845#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {4845#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,059 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,059 INFO L273 TraceCheckUtils]: 38: Hoare triple {4846#(<= main_~i~0 8)} assume true; {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {4846#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {4846#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,061 INFO L273 TraceCheckUtils]: 41: Hoare triple {4846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,062 INFO L273 TraceCheckUtils]: 42: Hoare triple {4847#(<= main_~i~0 9)} assume true; {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,062 INFO L273 TraceCheckUtils]: 43: Hoare triple {4847#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {4847#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,063 INFO L273 TraceCheckUtils]: 45: Hoare triple {4847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,064 INFO L273 TraceCheckUtils]: 46: Hoare triple {4848#(<= main_~i~0 10)} assume true; {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,064 INFO L273 TraceCheckUtils]: 47: Hoare triple {4848#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,065 INFO L273 TraceCheckUtils]: 48: Hoare triple {4848#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,066 INFO L273 TraceCheckUtils]: 49: Hoare triple {4848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {4849#(<= main_~i~0 11)} assume true; {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,067 INFO L273 TraceCheckUtils]: 51: Hoare triple {4849#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,067 INFO L273 TraceCheckUtils]: 52: Hoare triple {4849#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,068 INFO L273 TraceCheckUtils]: 53: Hoare triple {4849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4850#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,068 INFO L273 TraceCheckUtils]: 54: Hoare triple {4850#(<= main_~i~0 12)} assume true; {4850#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {4850#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4837#false} is VALID [2018-11-18 22:56:55,069 INFO L273 TraceCheckUtils]: 56: Hoare triple {4837#false} havoc ~x~0;~x~0 := 0; {4837#false} is VALID [2018-11-18 22:56:55,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {4837#false} assume true; {4837#false} is VALID [2018-11-18 22:56:55,070 INFO L273 TraceCheckUtils]: 58: Hoare triple {4837#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4837#false} is VALID [2018-11-18 22:56:55,070 INFO L256 TraceCheckUtils]: 59: Hoare triple {4837#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4837#false} is VALID [2018-11-18 22:56:55,070 INFO L273 TraceCheckUtils]: 60: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2018-11-18 22:56:55,070 INFO L273 TraceCheckUtils]: 61: Hoare triple {4837#false} assume 0 == ~cond; {4837#false} is VALID [2018-11-18 22:56:55,070 INFO L273 TraceCheckUtils]: 62: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2018-11-18 22:56:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:55,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:55,074 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-18 22:56:55,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:56:55,230 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:56:55,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:55,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:55,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4836#true} is VALID [2018-11-18 22:56:55,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {4836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4836#true} is VALID [2018-11-18 22:56:55,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2018-11-18 22:56:55,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #73#return; {4836#true} is VALID [2018-11-18 22:56:55,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2018-11-18 22:56:55,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {4836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4869#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {4869#(<= main_~i~0 0)} assume true; {4869#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {4869#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4869#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {4869#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4869#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:55,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {4869#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {4839#(<= main_~i~0 1)} assume true; {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {4839#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {4839#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4839#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:55,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {4839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {4840#(<= main_~i~0 2)} assume true; {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {4840#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {4840#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4840#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:55,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {4841#(<= main_~i~0 3)} assume true; {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {4841#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {4841#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4841#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:55,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {4841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {4842#(<= main_~i~0 4)} assume true; {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {4842#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4842#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:55,393 INFO L273 TraceCheckUtils]: 25: Hoare triple {4842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {4843#(<= main_~i~0 5)} assume true; {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {4843#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4843#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:55,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {4843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {4844#(<= main_~i~0 6)} assume true; {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {4844#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {4844#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4844#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:55,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {4844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(<= main_~i~0 7)} assume true; {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {4845#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {4845#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4845#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:55,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {4846#(<= main_~i~0 8)} assume true; {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {4846#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {4846#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4846#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:55,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {4846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {4847#(<= main_~i~0 9)} assume true; {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {4847#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,423 INFO L273 TraceCheckUtils]: 44: Hoare triple {4847#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4847#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:55,423 INFO L273 TraceCheckUtils]: 45: Hoare triple {4847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {4848#(<= main_~i~0 10)} assume true; {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,425 INFO L273 TraceCheckUtils]: 47: Hoare triple {4848#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,427 INFO L273 TraceCheckUtils]: 48: Hoare triple {4848#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4848#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:55,427 INFO L273 TraceCheckUtils]: 49: Hoare triple {4848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,428 INFO L273 TraceCheckUtils]: 50: Hoare triple {4849#(<= main_~i~0 11)} assume true; {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,431 INFO L273 TraceCheckUtils]: 51: Hoare triple {4849#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,434 INFO L273 TraceCheckUtils]: 52: Hoare triple {4849#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4849#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:55,434 INFO L273 TraceCheckUtils]: 53: Hoare triple {4849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4850#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,437 INFO L273 TraceCheckUtils]: 54: Hoare triple {4850#(<= main_~i~0 12)} assume true; {4850#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:55,439 INFO L273 TraceCheckUtils]: 55: Hoare triple {4850#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4837#false} is VALID [2018-11-18 22:56:55,439 INFO L273 TraceCheckUtils]: 56: Hoare triple {4837#false} havoc ~x~0;~x~0 := 0; {4837#false} is VALID [2018-11-18 22:56:55,439 INFO L273 TraceCheckUtils]: 57: Hoare triple {4837#false} assume true; {4837#false} is VALID [2018-11-18 22:56:55,439 INFO L273 TraceCheckUtils]: 58: Hoare triple {4837#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4837#false} is VALID [2018-11-18 22:56:55,439 INFO L256 TraceCheckUtils]: 59: Hoare triple {4837#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4837#false} is VALID [2018-11-18 22:56:55,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2018-11-18 22:56:55,439 INFO L273 TraceCheckUtils]: 61: Hoare triple {4837#false} assume 0 == ~cond; {4837#false} is VALID [2018-11-18 22:56:55,440 INFO L273 TraceCheckUtils]: 62: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2018-11-18 22:56:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:56:55,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-18 22:56:55,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:55,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:56:55,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:56:55,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:56:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:56:55,543 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 16 states. [2018-11-18 22:56:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:56,194 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-18 22:56:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:56:56,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-11-18 22:56:56,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:56:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2018-11-18 22:56:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:56:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2018-11-18 22:56:56,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2018-11-18 22:56:56,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:56,363 INFO L225 Difference]: With dead ends: 98 [2018-11-18 22:56:56,363 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 22:56:56,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:56:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 22:56:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-18 22:56:56,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:56,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-18 22:56:56,518 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-18 22:56:56,518 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-18 22:56:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:56,522 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2018-11-18 22:56:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-11-18 22:56:56,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:56,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:56,523 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-18 22:56:56,523 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-18 22:56:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:56,525 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2018-11-18 22:56:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-11-18 22:56:56,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:56,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:56,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:56,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 22:56:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2018-11-18 22:56:56,528 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 63 [2018-11-18 22:56:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:56,528 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2018-11-18 22:56:56,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:56:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2018-11-18 22:56:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 22:56:56,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:56,530 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:56,530 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:56,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:56,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1233232003, now seen corresponding path program 13 times [2018-11-18 22:56:56,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:56,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:56,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:56:56,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:57,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {5427#true} call ULTIMATE.init(); {5427#true} is VALID [2018-11-18 22:56:57,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {5427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5427#true} is VALID [2018-11-18 22:56:57,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {5427#true} assume true; {5427#true} is VALID [2018-11-18 22:56:57,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5427#true} {5427#true} #73#return; {5427#true} is VALID [2018-11-18 22:56:57,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {5427#true} call #t~ret7 := main(); {5427#true} is VALID [2018-11-18 22:56:57,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {5427#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5429#(= main_~i~0 0)} is VALID [2018-11-18 22:56:57,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {5429#(= main_~i~0 0)} assume true; {5429#(= main_~i~0 0)} is VALID [2018-11-18 22:56:57,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {5429#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5429#(= main_~i~0 0)} is VALID [2018-11-18 22:56:57,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {5429#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5429#(= main_~i~0 0)} is VALID [2018-11-18 22:56:57,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {5429#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#(<= main_~i~0 1)} assume true; {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {5431#(<= main_~i~0 2)} assume true; {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {5431#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {5431#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {5431#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {5432#(<= main_~i~0 3)} assume true; {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {5432#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {5432#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {5432#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {5433#(<= main_~i~0 4)} assume true; {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {5433#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {5433#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {5433#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,079 INFO L273 TraceCheckUtils]: 26: Hoare triple {5434#(<= main_~i~0 5)} assume true; {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {5434#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,080 INFO L273 TraceCheckUtils]: 28: Hoare triple {5434#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,081 INFO L273 TraceCheckUtils]: 29: Hoare triple {5434#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,081 INFO L273 TraceCheckUtils]: 30: Hoare triple {5435#(<= main_~i~0 6)} assume true; {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,082 INFO L273 TraceCheckUtils]: 31: Hoare triple {5435#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,082 INFO L273 TraceCheckUtils]: 32: Hoare triple {5435#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {5435#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#(<= main_~i~0 7)} assume true; {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,084 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,085 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,085 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,086 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#(<= main_~i~0 8)} assume true; {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,086 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,087 INFO L273 TraceCheckUtils]: 40: Hoare triple {5437#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,088 INFO L273 TraceCheckUtils]: 41: Hoare triple {5437#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,088 INFO L273 TraceCheckUtils]: 42: Hoare triple {5438#(<= main_~i~0 9)} assume true; {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,089 INFO L273 TraceCheckUtils]: 43: Hoare triple {5438#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,089 INFO L273 TraceCheckUtils]: 44: Hoare triple {5438#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,090 INFO L273 TraceCheckUtils]: 45: Hoare triple {5438#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,091 INFO L273 TraceCheckUtils]: 46: Hoare triple {5439#(<= main_~i~0 10)} assume true; {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,091 INFO L273 TraceCheckUtils]: 47: Hoare triple {5439#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,092 INFO L273 TraceCheckUtils]: 48: Hoare triple {5439#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,092 INFO L273 TraceCheckUtils]: 49: Hoare triple {5439#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,093 INFO L273 TraceCheckUtils]: 50: Hoare triple {5440#(<= main_~i~0 11)} assume true; {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,093 INFO L273 TraceCheckUtils]: 51: Hoare triple {5440#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {5440#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,095 INFO L273 TraceCheckUtils]: 53: Hoare triple {5440#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,095 INFO L273 TraceCheckUtils]: 54: Hoare triple {5441#(<= main_~i~0 12)} assume true; {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,096 INFO L273 TraceCheckUtils]: 55: Hoare triple {5441#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,096 INFO L273 TraceCheckUtils]: 56: Hoare triple {5441#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,097 INFO L273 TraceCheckUtils]: 57: Hoare triple {5441#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5442#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:57,098 INFO L273 TraceCheckUtils]: 58: Hoare triple {5442#(<= main_~i~0 13)} assume true; {5442#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:57,098 INFO L273 TraceCheckUtils]: 59: Hoare triple {5442#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5428#false} is VALID [2018-11-18 22:56:57,098 INFO L273 TraceCheckUtils]: 60: Hoare triple {5428#false} havoc ~x~0;~x~0 := 0; {5428#false} is VALID [2018-11-18 22:56:57,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {5428#false} assume true; {5428#false} is VALID [2018-11-18 22:56:57,099 INFO L273 TraceCheckUtils]: 62: Hoare triple {5428#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {5428#false} is VALID [2018-11-18 22:56:57,099 INFO L256 TraceCheckUtils]: 63: Hoare triple {5428#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5428#false} is VALID [2018-11-18 22:56:57,099 INFO L273 TraceCheckUtils]: 64: Hoare triple {5428#false} ~cond := #in~cond; {5428#false} is VALID [2018-11-18 22:56:57,100 INFO L273 TraceCheckUtils]: 65: Hoare triple {5428#false} assume 0 == ~cond; {5428#false} is VALID [2018-11-18 22:56:57,100 INFO L273 TraceCheckUtils]: 66: Hoare triple {5428#false} assume !false; {5428#false} is VALID [2018-11-18 22:56:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:57,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:57,104 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-18 22:56:57,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:57,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:57,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {5427#true} call ULTIMATE.init(); {5427#true} is VALID [2018-11-18 22:56:57,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {5427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5427#true} is VALID [2018-11-18 22:56:57,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {5427#true} assume true; {5427#true} is VALID [2018-11-18 22:56:57,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5427#true} {5427#true} #73#return; {5427#true} is VALID [2018-11-18 22:56:57,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {5427#true} call #t~ret7 := main(); {5427#true} is VALID [2018-11-18 22:56:57,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {5427#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5461#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:57,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {5461#(<= main_~i~0 0)} assume true; {5461#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:57,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {5461#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5461#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:57,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {5461#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5461#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:57,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {5461#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#(<= main_~i~0 1)} assume true; {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5430#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:57,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {5431#(<= main_~i~0 2)} assume true; {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {5431#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {5431#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5431#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:57,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {5431#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {5432#(<= main_~i~0 3)} assume true; {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {5432#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {5432#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5432#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:57,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {5432#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {5433#(<= main_~i~0 4)} assume true; {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {5433#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,314 INFO L273 TraceCheckUtils]: 24: Hoare triple {5433#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5433#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:57,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {5433#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {5434#(<= main_~i~0 5)} assume true; {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {5434#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,316 INFO L273 TraceCheckUtils]: 28: Hoare triple {5434#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5434#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:57,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {5434#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,318 INFO L273 TraceCheckUtils]: 30: Hoare triple {5435#(<= main_~i~0 6)} assume true; {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {5435#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {5435#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5435#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:57,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {5435#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {5436#(<= main_~i~0 7)} assume true; {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {5436#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {5436#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5436#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:57,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {5437#(<= main_~i~0 8)} assume true; {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,323 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,323 INFO L273 TraceCheckUtils]: 40: Hoare triple {5437#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5437#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:57,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {5437#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {5438#(<= main_~i~0 9)} assume true; {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {5438#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {5438#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5438#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:57,326 INFO L273 TraceCheckUtils]: 45: Hoare triple {5438#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,327 INFO L273 TraceCheckUtils]: 46: Hoare triple {5439#(<= main_~i~0 10)} assume true; {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,328 INFO L273 TraceCheckUtils]: 47: Hoare triple {5439#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {5439#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5439#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:57,329 INFO L273 TraceCheckUtils]: 49: Hoare triple {5439#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,329 INFO L273 TraceCheckUtils]: 50: Hoare triple {5440#(<= main_~i~0 11)} assume true; {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,330 INFO L273 TraceCheckUtils]: 51: Hoare triple {5440#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,330 INFO L273 TraceCheckUtils]: 52: Hoare triple {5440#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5440#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:57,331 INFO L273 TraceCheckUtils]: 53: Hoare triple {5440#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,332 INFO L273 TraceCheckUtils]: 54: Hoare triple {5441#(<= main_~i~0 12)} assume true; {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {5441#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,333 INFO L273 TraceCheckUtils]: 56: Hoare triple {5441#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5441#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:57,333 INFO L273 TraceCheckUtils]: 57: Hoare triple {5441#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5442#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:57,334 INFO L273 TraceCheckUtils]: 58: Hoare triple {5442#(<= main_~i~0 13)} assume true; {5442#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:57,335 INFO L273 TraceCheckUtils]: 59: Hoare triple {5442#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5428#false} is VALID [2018-11-18 22:56:57,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {5428#false} havoc ~x~0;~x~0 := 0; {5428#false} is VALID [2018-11-18 22:56:57,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {5428#false} assume true; {5428#false} is VALID [2018-11-18 22:56:57,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {5428#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {5428#false} is VALID [2018-11-18 22:56:57,336 INFO L256 TraceCheckUtils]: 63: Hoare triple {5428#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5428#false} is VALID [2018-11-18 22:56:57,336 INFO L273 TraceCheckUtils]: 64: Hoare triple {5428#false} ~cond := #in~cond; {5428#false} is VALID [2018-11-18 22:56:57,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {5428#false} assume 0 == ~cond; {5428#false} is VALID [2018-11-18 22:56:57,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {5428#false} assume !false; {5428#false} is VALID [2018-11-18 22:56:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:57,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:57,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:56:57,361 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-18 22:56:57,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:57,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:56:57,428 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-18 22:56:57,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:56:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:56:57,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:56:57,429 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 17 states. [2018-11-18 22:56:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:57,675 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2018-11-18 22:56:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:56:57,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-18 22:56:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:56:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 123 transitions. [2018-11-18 22:56:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:56:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 123 transitions. [2018-11-18 22:56:57,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 123 transitions. [2018-11-18 22:56:58,109 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-18 22:56:58,111 INFO L225 Difference]: With dead ends: 102 [2018-11-18 22:56:58,111 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 22:56:58,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:56:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 22:56:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-18 22:56:58,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:56:58,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-18 22:56:58,132 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-18 22:56:58,132 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-18 22:56:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:58,133 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-11-18 22:56:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-18 22:56:58,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:58,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:58,134 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-18 22:56:58,134 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-18 22:56:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:58,137 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-11-18 22:56:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-18 22:56:58,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:56:58,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:56:58,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:56:58,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:56:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 22:56:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-18 22:56:58,139 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 67 [2018-11-18 22:56:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:56:58,140 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-18 22:56:58,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:56:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-18 22:56:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 22:56:58,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:56:58,141 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:56:58,141 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:56:58,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:56:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash 777456660, now seen corresponding path program 14 times [2018-11-18 22:56:58,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:56:58,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:56:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:58,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:56:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:56:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:59,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {6049#true} call ULTIMATE.init(); {6049#true} is VALID [2018-11-18 22:56:59,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {6049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6049#true} is VALID [2018-11-18 22:56:59,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {6049#true} assume true; {6049#true} is VALID [2018-11-18 22:56:59,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6049#true} {6049#true} #73#return; {6049#true} is VALID [2018-11-18 22:56:59,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {6049#true} call #t~ret7 := main(); {6049#true} is VALID [2018-11-18 22:56:59,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {6049#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6051#(= main_~i~0 0)} is VALID [2018-11-18 22:56:59,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {6051#(= main_~i~0 0)} assume true; {6051#(= main_~i~0 0)} is VALID [2018-11-18 22:56:59,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {6051#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6051#(= main_~i~0 0)} is VALID [2018-11-18 22:56:59,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {6051#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6051#(= main_~i~0 0)} is VALID [2018-11-18 22:56:59,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {6051#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {6052#(<= main_~i~0 1)} assume true; {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {6052#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {6052#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {6052#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {6053#(<= main_~i~0 2)} assume true; {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {6053#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {6053#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {6053#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {6054#(<= main_~i~0 3)} assume true; {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {6054#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {6054#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {6054#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {6055#(<= main_~i~0 4)} assume true; {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {6055#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {6055#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {6055#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {6056#(<= main_~i~0 5)} assume true; {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {6056#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {6056#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {6056#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {6057#(<= main_~i~0 6)} assume true; {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {6057#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {6057#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {6057#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {6058#(<= main_~i~0 7)} assume true; {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {6058#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {6058#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {6058#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#(<= main_~i~0 8)} assume true; {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,099 INFO L273 TraceCheckUtils]: 39: Hoare triple {6059#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {6059#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,100 INFO L273 TraceCheckUtils]: 41: Hoare triple {6059#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {6060#(<= main_~i~0 9)} assume true; {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,101 INFO L273 TraceCheckUtils]: 43: Hoare triple {6060#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {6060#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {6060#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#(<= main_~i~0 10)} assume true; {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,104 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,104 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,105 INFO L273 TraceCheckUtils]: 50: Hoare triple {6062#(<= main_~i~0 11)} assume true; {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,105 INFO L273 TraceCheckUtils]: 51: Hoare triple {6062#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {6062#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {6062#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,107 INFO L273 TraceCheckUtils]: 54: Hoare triple {6063#(<= main_~i~0 12)} assume true; {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,108 INFO L273 TraceCheckUtils]: 55: Hoare triple {6063#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,108 INFO L273 TraceCheckUtils]: 56: Hoare triple {6063#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,109 INFO L273 TraceCheckUtils]: 57: Hoare triple {6063#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,109 INFO L273 TraceCheckUtils]: 58: Hoare triple {6064#(<= main_~i~0 13)} assume true; {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,110 INFO L273 TraceCheckUtils]: 59: Hoare triple {6064#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,110 INFO L273 TraceCheckUtils]: 60: Hoare triple {6064#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,111 INFO L273 TraceCheckUtils]: 61: Hoare triple {6064#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6065#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:59,111 INFO L273 TraceCheckUtils]: 62: Hoare triple {6065#(<= main_~i~0 14)} assume true; {6065#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:59,112 INFO L273 TraceCheckUtils]: 63: Hoare triple {6065#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6050#false} is VALID [2018-11-18 22:56:59,112 INFO L273 TraceCheckUtils]: 64: Hoare triple {6050#false} havoc ~x~0;~x~0 := 0; {6050#false} is VALID [2018-11-18 22:56:59,113 INFO L273 TraceCheckUtils]: 65: Hoare triple {6050#false} assume true; {6050#false} is VALID [2018-11-18 22:56:59,113 INFO L273 TraceCheckUtils]: 66: Hoare triple {6050#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6050#false} is VALID [2018-11-18 22:56:59,113 INFO L256 TraceCheckUtils]: 67: Hoare triple {6050#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6050#false} is VALID [2018-11-18 22:56:59,113 INFO L273 TraceCheckUtils]: 68: Hoare triple {6050#false} ~cond := #in~cond; {6050#false} is VALID [2018-11-18 22:56:59,113 INFO L273 TraceCheckUtils]: 69: Hoare triple {6050#false} assume 0 == ~cond; {6050#false} is VALID [2018-11-18 22:56:59,114 INFO L273 TraceCheckUtils]: 70: Hoare triple {6050#false} assume !false; {6050#false} is VALID [2018-11-18 22:56:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:59,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:56:59,117 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-18 22:56:59,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:56:59,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:56:59,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:56:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:56:59,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:56:59,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {6049#true} call ULTIMATE.init(); {6049#true} is VALID [2018-11-18 22:56:59,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {6049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6049#true} is VALID [2018-11-18 22:56:59,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {6049#true} assume true; {6049#true} is VALID [2018-11-18 22:56:59,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6049#true} {6049#true} #73#return; {6049#true} is VALID [2018-11-18 22:56:59,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {6049#true} call #t~ret7 := main(); {6049#true} is VALID [2018-11-18 22:56:59,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {6049#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6084#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:59,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {6084#(<= main_~i~0 0)} assume true; {6084#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:59,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {6084#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6084#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:59,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {6084#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6084#(<= main_~i~0 0)} is VALID [2018-11-18 22:56:59,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {6084#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {6052#(<= main_~i~0 1)} assume true; {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {6052#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {6052#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6052#(<= main_~i~0 1)} is VALID [2018-11-18 22:56:59,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {6052#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {6053#(<= main_~i~0 2)} assume true; {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {6053#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {6053#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6053#(<= main_~i~0 2)} is VALID [2018-11-18 22:56:59,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {6053#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {6054#(<= main_~i~0 3)} assume true; {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {6054#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {6054#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6054#(<= main_~i~0 3)} is VALID [2018-11-18 22:56:59,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {6054#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {6055#(<= main_~i~0 4)} assume true; {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {6055#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {6055#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6055#(<= main_~i~0 4)} is VALID [2018-11-18 22:56:59,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {6055#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {6056#(<= main_~i~0 5)} assume true; {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {6056#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,341 INFO L273 TraceCheckUtils]: 28: Hoare triple {6056#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6056#(<= main_~i~0 5)} is VALID [2018-11-18 22:56:59,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {6056#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {6057#(<= main_~i~0 6)} assume true; {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {6057#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {6057#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6057#(<= main_~i~0 6)} is VALID [2018-11-18 22:56:59,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {6057#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,345 INFO L273 TraceCheckUtils]: 34: Hoare triple {6058#(<= main_~i~0 7)} assume true; {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,345 INFO L273 TraceCheckUtils]: 35: Hoare triple {6058#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {6058#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6058#(<= main_~i~0 7)} is VALID [2018-11-18 22:56:59,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {6058#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#(<= main_~i~0 8)} assume true; {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {6059#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {6059#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6059#(<= main_~i~0 8)} is VALID [2018-11-18 22:56:59,349 INFO L273 TraceCheckUtils]: 41: Hoare triple {6059#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {6060#(<= main_~i~0 9)} assume true; {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,350 INFO L273 TraceCheckUtils]: 43: Hoare triple {6060#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {6060#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6060#(<= main_~i~0 9)} is VALID [2018-11-18 22:56:59,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {6060#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,352 INFO L273 TraceCheckUtils]: 46: Hoare triple {6061#(<= main_~i~0 10)} assume true; {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,352 INFO L273 TraceCheckUtils]: 47: Hoare triple {6061#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,353 INFO L273 TraceCheckUtils]: 48: Hoare triple {6061#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6061#(<= main_~i~0 10)} is VALID [2018-11-18 22:56:59,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {6061#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {6062#(<= main_~i~0 11)} assume true; {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,355 INFO L273 TraceCheckUtils]: 51: Hoare triple {6062#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {6062#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6062#(<= main_~i~0 11)} is VALID [2018-11-18 22:56:59,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {6062#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,356 INFO L273 TraceCheckUtils]: 54: Hoare triple {6063#(<= main_~i~0 12)} assume true; {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,357 INFO L273 TraceCheckUtils]: 55: Hoare triple {6063#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,357 INFO L273 TraceCheckUtils]: 56: Hoare triple {6063#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6063#(<= main_~i~0 12)} is VALID [2018-11-18 22:56:59,358 INFO L273 TraceCheckUtils]: 57: Hoare triple {6063#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,359 INFO L273 TraceCheckUtils]: 58: Hoare triple {6064#(<= main_~i~0 13)} assume true; {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,359 INFO L273 TraceCheckUtils]: 59: Hoare triple {6064#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,360 INFO L273 TraceCheckUtils]: 60: Hoare triple {6064#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6064#(<= main_~i~0 13)} is VALID [2018-11-18 22:56:59,361 INFO L273 TraceCheckUtils]: 61: Hoare triple {6064#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6065#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:59,361 INFO L273 TraceCheckUtils]: 62: Hoare triple {6065#(<= main_~i~0 14)} assume true; {6065#(<= main_~i~0 14)} is VALID [2018-11-18 22:56:59,362 INFO L273 TraceCheckUtils]: 63: Hoare triple {6065#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6050#false} is VALID [2018-11-18 22:56:59,362 INFO L273 TraceCheckUtils]: 64: Hoare triple {6050#false} havoc ~x~0;~x~0 := 0; {6050#false} is VALID [2018-11-18 22:56:59,362 INFO L273 TraceCheckUtils]: 65: Hoare triple {6050#false} assume true; {6050#false} is VALID [2018-11-18 22:56:59,363 INFO L273 TraceCheckUtils]: 66: Hoare triple {6050#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6050#false} is VALID [2018-11-18 22:56:59,363 INFO L256 TraceCheckUtils]: 67: Hoare triple {6050#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6050#false} is VALID [2018-11-18 22:56:59,363 INFO L273 TraceCheckUtils]: 68: Hoare triple {6050#false} ~cond := #in~cond; {6050#false} is VALID [2018-11-18 22:56:59,363 INFO L273 TraceCheckUtils]: 69: Hoare triple {6050#false} assume 0 == ~cond; {6050#false} is VALID [2018-11-18 22:56:59,363 INFO L273 TraceCheckUtils]: 70: Hoare triple {6050#false} assume !false; {6050#false} is VALID [2018-11-18 22:56:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:56:59,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:56:59,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:56:59,387 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-18 22:56:59,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:56:59,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:56:59,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:56:59,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:56:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:56:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:56:59,461 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 18 states. [2018-11-18 22:56:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:56:59,981 INFO L93 Difference]: Finished difference Result 106 states and 128 transitions. [2018-11-18 22:56:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:56:59,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-11-18 22:56:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:56:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:56:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2018-11-18 22:56:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:56:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 128 transitions. [2018-11-18 22:56:59,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 128 transitions. [2018-11-18 22:57:00,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:00,417 INFO L225 Difference]: With dead ends: 106 [2018-11-18 22:57:00,417 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 22:57:00,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 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-18 22:57:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 22:57:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-18 22:57:00,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:00,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2018-11-18 22:57:00,437 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2018-11-18 22:57:00,437 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2018-11-18 22:57:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:00,439 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2018-11-18 22:57:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-11-18 22:57:00,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:00,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:00,440 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2018-11-18 22:57:00,440 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2018-11-18 22:57:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:00,442 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2018-11-18 22:57:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-11-18 22:57:00,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:00,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:00,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:00,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 22:57:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2018-11-18 22:57:00,445 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 71 [2018-11-18 22:57:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:00,445 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2018-11-18 22:57:00,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:57:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2018-11-18 22:57:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 22:57:00,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:00,447 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:00,447 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:00,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2051642667, now seen corresponding path program 15 times [2018-11-18 22:57:00,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:00,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:00,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:01,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {6702#true} call ULTIMATE.init(); {6702#true} is VALID [2018-11-18 22:57:01,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {6702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6702#true} is VALID [2018-11-18 22:57:01,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {6702#true} assume true; {6702#true} is VALID [2018-11-18 22:57:01,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6702#true} {6702#true} #73#return; {6702#true} is VALID [2018-11-18 22:57:01,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {6702#true} call #t~ret7 := main(); {6702#true} is VALID [2018-11-18 22:57:01,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {6702#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6704#(= main_~i~0 0)} is VALID [2018-11-18 22:57:01,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {6704#(= main_~i~0 0)} assume true; {6704#(= main_~i~0 0)} is VALID [2018-11-18 22:57:01,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {6704#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6704#(= main_~i~0 0)} is VALID [2018-11-18 22:57:01,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {6704#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6704#(= main_~i~0 0)} is VALID [2018-11-18 22:57:01,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {6704#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {6705#(<= main_~i~0 1)} assume true; {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {6705#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {6705#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {6705#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {6706#(<= main_~i~0 2)} assume true; {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {6706#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {6706#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {6706#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {6707#(<= main_~i~0 3)} assume true; {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,077 INFO L273 TraceCheckUtils]: 19: Hoare triple {6707#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {6707#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {6707#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {6708#(<= main_~i~0 4)} assume true; {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,079 INFO L273 TraceCheckUtils]: 23: Hoare triple {6708#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,080 INFO L273 TraceCheckUtils]: 24: Hoare triple {6708#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {6708#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {6709#(<= main_~i~0 5)} assume true; {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {6709#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {6709#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {6709#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {6710#(<= main_~i~0 6)} assume true; {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {6710#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {6710#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {6710#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {6711#(<= main_~i~0 7)} assume true; {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {6711#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,087 INFO L273 TraceCheckUtils]: 36: Hoare triple {6711#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,088 INFO L273 TraceCheckUtils]: 37: Hoare triple {6711#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,088 INFO L273 TraceCheckUtils]: 38: Hoare triple {6712#(<= main_~i~0 8)} assume true; {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {6712#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,089 INFO L273 TraceCheckUtils]: 40: Hoare triple {6712#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {6712#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {6713#(<= main_~i~0 9)} assume true; {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {6713#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {6713#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {6713#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {6714#(<= main_~i~0 10)} assume true; {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {6714#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,094 INFO L273 TraceCheckUtils]: 48: Hoare triple {6714#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {6714#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {6715#(<= main_~i~0 11)} assume true; {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {6715#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {6715#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,097 INFO L273 TraceCheckUtils]: 53: Hoare triple {6715#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {6716#(<= main_~i~0 12)} assume true; {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {6716#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,116 INFO L273 TraceCheckUtils]: 56: Hoare triple {6716#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {6716#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,119 INFO L273 TraceCheckUtils]: 58: Hoare triple {6717#(<= main_~i~0 13)} assume true; {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {6717#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {6717#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {6717#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,120 INFO L273 TraceCheckUtils]: 62: Hoare triple {6718#(<= main_~i~0 14)} assume true; {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {6718#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,121 INFO L273 TraceCheckUtils]: 64: Hoare triple {6718#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,121 INFO L273 TraceCheckUtils]: 65: Hoare triple {6718#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6719#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,122 INFO L273 TraceCheckUtils]: 66: Hoare triple {6719#(<= main_~i~0 15)} assume true; {6719#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,122 INFO L273 TraceCheckUtils]: 67: Hoare triple {6719#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6703#false} is VALID [2018-11-18 22:57:01,123 INFO L273 TraceCheckUtils]: 68: Hoare triple {6703#false} havoc ~x~0;~x~0 := 0; {6703#false} is VALID [2018-11-18 22:57:01,123 INFO L273 TraceCheckUtils]: 69: Hoare triple {6703#false} assume true; {6703#false} is VALID [2018-11-18 22:57:01,123 INFO L273 TraceCheckUtils]: 70: Hoare triple {6703#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6703#false} is VALID [2018-11-18 22:57:01,123 INFO L256 TraceCheckUtils]: 71: Hoare triple {6703#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6703#false} is VALID [2018-11-18 22:57:01,124 INFO L273 TraceCheckUtils]: 72: Hoare triple {6703#false} ~cond := #in~cond; {6703#false} is VALID [2018-11-18 22:57:01,124 INFO L273 TraceCheckUtils]: 73: Hoare triple {6703#false} assume 0 == ~cond; {6703#false} is VALID [2018-11-18 22:57:01,124 INFO L273 TraceCheckUtils]: 74: Hoare triple {6703#false} assume !false; {6703#false} is VALID [2018-11-18 22:57:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:01,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:01,128 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-18 22:57:01,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:01,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:57:01,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:01,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:01,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {6702#true} call ULTIMATE.init(); {6702#true} is VALID [2018-11-18 22:57:01,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {6702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6702#true} is VALID [2018-11-18 22:57:01,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {6702#true} assume true; {6702#true} is VALID [2018-11-18 22:57:01,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6702#true} {6702#true} #73#return; {6702#true} is VALID [2018-11-18 22:57:01,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {6702#true} call #t~ret7 := main(); {6702#true} is VALID [2018-11-18 22:57:01,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {6702#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6738#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:01,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {6738#(<= main_~i~0 0)} assume true; {6738#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:01,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {6738#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:01,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {6738#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6738#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:01,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {6738#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {6705#(<= main_~i~0 1)} assume true; {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {6705#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {6705#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6705#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:01,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {6705#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {6706#(<= main_~i~0 2)} assume true; {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {6706#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {6706#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6706#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:01,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {6706#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {6707#(<= main_~i~0 3)} assume true; {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {6707#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {6707#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6707#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:01,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {6707#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {6708#(<= main_~i~0 4)} assume true; {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {6708#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {6708#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6708#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:01,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {6708#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {6709#(<= main_~i~0 5)} assume true; {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,637 INFO L273 TraceCheckUtils]: 27: Hoare triple {6709#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {6709#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6709#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:01,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {6709#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {6710#(<= main_~i~0 6)} assume true; {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {6710#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {6710#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6710#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:01,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {6710#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {6711#(<= main_~i~0 7)} assume true; {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {6711#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {6711#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6711#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:01,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {6711#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {6712#(<= main_~i~0 8)} assume true; {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {6712#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {6712#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6712#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:01,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {6712#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {6713#(<= main_~i~0 9)} assume true; {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {6713#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,648 INFO L273 TraceCheckUtils]: 44: Hoare triple {6713#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6713#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:01,649 INFO L273 TraceCheckUtils]: 45: Hoare triple {6713#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,650 INFO L273 TraceCheckUtils]: 46: Hoare triple {6714#(<= main_~i~0 10)} assume true; {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,650 INFO L273 TraceCheckUtils]: 47: Hoare triple {6714#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,651 INFO L273 TraceCheckUtils]: 48: Hoare triple {6714#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6714#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:01,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {6714#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,653 INFO L273 TraceCheckUtils]: 50: Hoare triple {6715#(<= main_~i~0 11)} assume true; {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {6715#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,654 INFO L273 TraceCheckUtils]: 52: Hoare triple {6715#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6715#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:01,655 INFO L273 TraceCheckUtils]: 53: Hoare triple {6715#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,655 INFO L273 TraceCheckUtils]: 54: Hoare triple {6716#(<= main_~i~0 12)} assume true; {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {6716#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,657 INFO L273 TraceCheckUtils]: 56: Hoare triple {6716#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6716#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:01,657 INFO L273 TraceCheckUtils]: 57: Hoare triple {6716#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,658 INFO L273 TraceCheckUtils]: 58: Hoare triple {6717#(<= main_~i~0 13)} assume true; {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {6717#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {6717#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6717#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:01,660 INFO L273 TraceCheckUtils]: 61: Hoare triple {6717#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {6718#(<= main_~i~0 14)} assume true; {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,661 INFO L273 TraceCheckUtils]: 63: Hoare triple {6718#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {6718#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6718#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:01,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {6718#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6719#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,663 INFO L273 TraceCheckUtils]: 66: Hoare triple {6719#(<= main_~i~0 15)} assume true; {6719#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:01,664 INFO L273 TraceCheckUtils]: 67: Hoare triple {6719#(<= main_~i~0 15)} assume !(~i~0 < 100000); {6703#false} is VALID [2018-11-18 22:57:01,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {6703#false} havoc ~x~0;~x~0 := 0; {6703#false} is VALID [2018-11-18 22:57:01,665 INFO L273 TraceCheckUtils]: 69: Hoare triple {6703#false} assume true; {6703#false} is VALID [2018-11-18 22:57:01,665 INFO L273 TraceCheckUtils]: 70: Hoare triple {6703#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6703#false} is VALID [2018-11-18 22:57:01,665 INFO L256 TraceCheckUtils]: 71: Hoare triple {6703#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6703#false} is VALID [2018-11-18 22:57:01,666 INFO L273 TraceCheckUtils]: 72: Hoare triple {6703#false} ~cond := #in~cond; {6703#false} is VALID [2018-11-18 22:57:01,666 INFO L273 TraceCheckUtils]: 73: Hoare triple {6703#false} assume 0 == ~cond; {6703#false} is VALID [2018-11-18 22:57:01,666 INFO L273 TraceCheckUtils]: 74: Hoare triple {6703#false} assume !false; {6703#false} is VALID [2018-11-18 22:57:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:01,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:01,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:57:01,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-18 22:57:01,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:01,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:57:01,780 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-18 22:57:01,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:57:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:57:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:57:01,781 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 19 states. [2018-11-18 22:57:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:03,013 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2018-11-18 22:57:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:57:03,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-11-18 22:57:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:57:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-11-18 22:57:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:57:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2018-11-18 22:57:03,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 133 transitions. [2018-11-18 22:57:03,514 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-18 22:57:03,517 INFO L225 Difference]: With dead ends: 110 [2018-11-18 22:57:03,517 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 22:57:03,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:57:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 22:57:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 22:57:03,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:03,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-18 22:57:03,547 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-18 22:57:03,547 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-18 22:57:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:03,551 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-18 22:57:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2018-11-18 22:57:03,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:03,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:03,552 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-18 22:57:03,552 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-18 22:57:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:03,554 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-18 22:57:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2018-11-18 22:57:03,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:03,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:03,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:03,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 22:57:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-11-18 22:57:03,557 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 75 [2018-11-18 22:57:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:03,557 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-18 22:57:03,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:57:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-18 22:57:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 22:57:03,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:03,558 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:03,559 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:03,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash 152287938, now seen corresponding path program 16 times [2018-11-18 22:57:03,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:03,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:03,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:04,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {7386#true} call ULTIMATE.init(); {7386#true} is VALID [2018-11-18 22:57:04,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {7386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7386#true} is VALID [2018-11-18 22:57:04,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {7386#true} assume true; {7386#true} is VALID [2018-11-18 22:57:04,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7386#true} {7386#true} #73#return; {7386#true} is VALID [2018-11-18 22:57:04,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {7386#true} call #t~ret7 := main(); {7386#true} is VALID [2018-11-18 22:57:04,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {7386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7388#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {7388#(= main_~i~0 0)} assume true; {7388#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {7388#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7388#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {7388#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7388#(= main_~i~0 0)} is VALID [2018-11-18 22:57:04,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {7388#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {7389#(<= main_~i~0 1)} assume true; {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {7389#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {7389#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:04,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {7389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {7390#(<= main_~i~0 2)} assume true; {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {7390#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {7390#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:04,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {7390#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {7391#(<= main_~i~0 3)} assume true; {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {7391#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {7391#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:04,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {7391#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {7392#(<= main_~i~0 4)} assume true; {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {7392#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:04,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 5)} assume true; {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,914 INFO L273 TraceCheckUtils]: 27: Hoare triple {7393#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {7393#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:04,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {7393#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {7394#(<= main_~i~0 6)} assume true; {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {7394#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {7394#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:04,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {7394#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {7395#(<= main_~i~0 7)} assume true; {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {7395#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {7395#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:04,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {7395#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {7396#(<= main_~i~0 8)} assume true; {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {7396#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,923 INFO L273 TraceCheckUtils]: 40: Hoare triple {7396#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:04,924 INFO L273 TraceCheckUtils]: 41: Hoare triple {7396#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,924 INFO L273 TraceCheckUtils]: 42: Hoare triple {7397#(<= main_~i~0 9)} assume true; {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,924 INFO L273 TraceCheckUtils]: 43: Hoare triple {7397#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,925 INFO L273 TraceCheckUtils]: 44: Hoare triple {7397#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:04,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {7397#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,926 INFO L273 TraceCheckUtils]: 46: Hoare triple {7398#(<= main_~i~0 10)} assume true; {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,927 INFO L273 TraceCheckUtils]: 47: Hoare triple {7398#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {7398#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:04,928 INFO L273 TraceCheckUtils]: 49: Hoare triple {7398#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,928 INFO L273 TraceCheckUtils]: 50: Hoare triple {7399#(<= main_~i~0 11)} assume true; {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,929 INFO L273 TraceCheckUtils]: 51: Hoare triple {7399#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,929 INFO L273 TraceCheckUtils]: 52: Hoare triple {7399#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:04,930 INFO L273 TraceCheckUtils]: 53: Hoare triple {7399#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,931 INFO L273 TraceCheckUtils]: 54: Hoare triple {7400#(<= main_~i~0 12)} assume true; {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,931 INFO L273 TraceCheckUtils]: 55: Hoare triple {7400#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,932 INFO L273 TraceCheckUtils]: 56: Hoare triple {7400#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:04,933 INFO L273 TraceCheckUtils]: 57: Hoare triple {7400#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,933 INFO L273 TraceCheckUtils]: 58: Hoare triple {7401#(<= main_~i~0 13)} assume true; {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {7401#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {7401#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:04,935 INFO L273 TraceCheckUtils]: 61: Hoare triple {7401#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {7402#(<= main_~i~0 14)} assume true; {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {7402#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,936 INFO L273 TraceCheckUtils]: 64: Hoare triple {7402#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:04,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {7402#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {7403#(<= main_~i~0 15)} assume true; {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,938 INFO L273 TraceCheckUtils]: 67: Hoare triple {7403#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {7403#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:04,939 INFO L273 TraceCheckUtils]: 69: Hoare triple {7403#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7404#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:04,940 INFO L273 TraceCheckUtils]: 70: Hoare triple {7404#(<= main_~i~0 16)} assume true; {7404#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:04,940 INFO L273 TraceCheckUtils]: 71: Hoare triple {7404#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7387#false} is VALID [2018-11-18 22:57:04,940 INFO L273 TraceCheckUtils]: 72: Hoare triple {7387#false} havoc ~x~0;~x~0 := 0; {7387#false} is VALID [2018-11-18 22:57:04,941 INFO L273 TraceCheckUtils]: 73: Hoare triple {7387#false} assume true; {7387#false} is VALID [2018-11-18 22:57:04,941 INFO L273 TraceCheckUtils]: 74: Hoare triple {7387#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {7387#false} is VALID [2018-11-18 22:57:04,941 INFO L256 TraceCheckUtils]: 75: Hoare triple {7387#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7387#false} is VALID [2018-11-18 22:57:04,941 INFO L273 TraceCheckUtils]: 76: Hoare triple {7387#false} ~cond := #in~cond; {7387#false} is VALID [2018-11-18 22:57:04,941 INFO L273 TraceCheckUtils]: 77: Hoare triple {7387#false} assume 0 == ~cond; {7387#false} is VALID [2018-11-18 22:57:04,942 INFO L273 TraceCheckUtils]: 78: Hoare triple {7387#false} assume !false; {7387#false} is VALID [2018-11-18 22:57:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:04,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:04,946 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-18 22:57:04,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:57:05,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:57:05,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:05,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:05,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {7386#true} call ULTIMATE.init(); {7386#true} is VALID [2018-11-18 22:57:05,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {7386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7386#true} is VALID [2018-11-18 22:57:05,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {7386#true} assume true; {7386#true} is VALID [2018-11-18 22:57:05,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7386#true} {7386#true} #73#return; {7386#true} is VALID [2018-11-18 22:57:05,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {7386#true} call #t~ret7 := main(); {7386#true} is VALID [2018-11-18 22:57:05,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {7386#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7423#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:05,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {7423#(<= main_~i~0 0)} assume true; {7423#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:05,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {7423#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7423#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:05,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {7423#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7423#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:05,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {7423#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {7389#(<= main_~i~0 1)} assume true; {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {7389#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {7389#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7389#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:05,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {7389#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {7390#(<= main_~i~0 2)} assume true; {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {7390#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {7390#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7390#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:05,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {7390#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {7391#(<= main_~i~0 3)} assume true; {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {7391#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {7391#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7391#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:05,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {7391#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {7392#(<= main_~i~0 4)} assume true; {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {7392#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {7392#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7392#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:05,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {7393#(<= main_~i~0 5)} assume true; {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {7393#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {7393#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7393#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:05,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {7393#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {7394#(<= main_~i~0 6)} assume true; {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {7394#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,335 INFO L273 TraceCheckUtils]: 32: Hoare triple {7394#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7394#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:05,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {7394#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {7395#(<= main_~i~0 7)} assume true; {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,337 INFO L273 TraceCheckUtils]: 35: Hoare triple {7395#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,337 INFO L273 TraceCheckUtils]: 36: Hoare triple {7395#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7395#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:05,338 INFO L273 TraceCheckUtils]: 37: Hoare triple {7395#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,338 INFO L273 TraceCheckUtils]: 38: Hoare triple {7396#(<= main_~i~0 8)} assume true; {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,339 INFO L273 TraceCheckUtils]: 39: Hoare triple {7396#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {7396#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7396#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:05,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {7396#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {7397#(<= main_~i~0 9)} assume true; {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {7397#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {7397#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7397#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:05,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {7397#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {7398#(<= main_~i~0 10)} assume true; {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {7398#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,344 INFO L273 TraceCheckUtils]: 48: Hoare triple {7398#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7398#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:05,344 INFO L273 TraceCheckUtils]: 49: Hoare triple {7398#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {7399#(<= main_~i~0 11)} assume true; {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,345 INFO L273 TraceCheckUtils]: 51: Hoare triple {7399#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,346 INFO L273 TraceCheckUtils]: 52: Hoare triple {7399#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7399#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:05,346 INFO L273 TraceCheckUtils]: 53: Hoare triple {7399#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,347 INFO L273 TraceCheckUtils]: 54: Hoare triple {7400#(<= main_~i~0 12)} assume true; {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,347 INFO L273 TraceCheckUtils]: 55: Hoare triple {7400#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,348 INFO L273 TraceCheckUtils]: 56: Hoare triple {7400#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7400#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:05,349 INFO L273 TraceCheckUtils]: 57: Hoare triple {7400#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,349 INFO L273 TraceCheckUtils]: 58: Hoare triple {7401#(<= main_~i~0 13)} assume true; {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {7401#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,350 INFO L273 TraceCheckUtils]: 60: Hoare triple {7401#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7401#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:05,351 INFO L273 TraceCheckUtils]: 61: Hoare triple {7401#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {7402#(<= main_~i~0 14)} assume true; {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,352 INFO L273 TraceCheckUtils]: 63: Hoare triple {7402#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {7402#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7402#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:05,353 INFO L273 TraceCheckUtils]: 65: Hoare triple {7402#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,353 INFO L273 TraceCheckUtils]: 66: Hoare triple {7403#(<= main_~i~0 15)} assume true; {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,354 INFO L273 TraceCheckUtils]: 67: Hoare triple {7403#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,354 INFO L273 TraceCheckUtils]: 68: Hoare triple {7403#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7403#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:05,355 INFO L273 TraceCheckUtils]: 69: Hoare triple {7403#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7404#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,356 INFO L273 TraceCheckUtils]: 70: Hoare triple {7404#(<= main_~i~0 16)} assume true; {7404#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:05,356 INFO L273 TraceCheckUtils]: 71: Hoare triple {7404#(<= main_~i~0 16)} assume !(~i~0 < 100000); {7387#false} is VALID [2018-11-18 22:57:05,357 INFO L273 TraceCheckUtils]: 72: Hoare triple {7387#false} havoc ~x~0;~x~0 := 0; {7387#false} is VALID [2018-11-18 22:57:05,357 INFO L273 TraceCheckUtils]: 73: Hoare triple {7387#false} assume true; {7387#false} is VALID [2018-11-18 22:57:05,357 INFO L273 TraceCheckUtils]: 74: Hoare triple {7387#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {7387#false} is VALID [2018-11-18 22:57:05,357 INFO L256 TraceCheckUtils]: 75: Hoare triple {7387#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7387#false} is VALID [2018-11-18 22:57:05,357 INFO L273 TraceCheckUtils]: 76: Hoare triple {7387#false} ~cond := #in~cond; {7387#false} is VALID [2018-11-18 22:57:05,357 INFO L273 TraceCheckUtils]: 77: Hoare triple {7387#false} assume 0 == ~cond; {7387#false} is VALID [2018-11-18 22:57:05,358 INFO L273 TraceCheckUtils]: 78: Hoare triple {7387#false} assume !false; {7387#false} is VALID [2018-11-18 22:57:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:57:05,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-18 22:57:05,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:05,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:57:05,457 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-18 22:57:05,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:57:05,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:57:05,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:57:05,458 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 20 states. [2018-11-18 22:57:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:06,134 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2018-11-18 22:57:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:57:06,135 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2018-11-18 22:57:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:57:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 138 transitions. [2018-11-18 22:57:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:57:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 138 transitions. [2018-11-18 22:57:06,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 138 transitions. [2018-11-18 22:57:06,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:06,263 INFO L225 Difference]: With dead ends: 114 [2018-11-18 22:57:06,263 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 22:57:06,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:57:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 22:57:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-18 22:57:06,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:06,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-18 22:57:06,288 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-18 22:57:06,289 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-18 22:57:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:06,290 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-11-18 22:57:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2018-11-18 22:57:06,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:06,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:06,291 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-18 22:57:06,291 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-18 22:57:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:06,293 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2018-11-18 22:57:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2018-11-18 22:57:06,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:06,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:06,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:06,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 22:57:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-18 22:57:06,296 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 79 [2018-11-18 22:57:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:06,296 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-18 22:57:06,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:57:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-18 22:57:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 22:57:06,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:06,297 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:06,298 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:06,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 882064601, now seen corresponding path program 17 times [2018-11-18 22:57:06,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:06,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:06,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:07,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {8101#true} call ULTIMATE.init(); {8101#true} is VALID [2018-11-18 22:57:07,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {8101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8101#true} is VALID [2018-11-18 22:57:07,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {8101#true} assume true; {8101#true} is VALID [2018-11-18 22:57:07,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8101#true} {8101#true} #73#return; {8101#true} is VALID [2018-11-18 22:57:07,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {8101#true} call #t~ret7 := main(); {8101#true} is VALID [2018-11-18 22:57:07,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {8101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8103#(= main_~i~0 0)} is VALID [2018-11-18 22:57:07,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {8103#(= main_~i~0 0)} assume true; {8103#(= main_~i~0 0)} is VALID [2018-11-18 22:57:07,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {8103#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8103#(= main_~i~0 0)} is VALID [2018-11-18 22:57:07,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {8103#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8103#(= main_~i~0 0)} is VALID [2018-11-18 22:57:07,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {8103#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:07,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {8104#(<= main_~i~0 1)} assume true; {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:07,635 INFO L273 TraceCheckUtils]: 11: Hoare triple {8104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:07,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {8104#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:07,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {8104#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:07,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {8105#(<= main_~i~0 2)} assume true; {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:07,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {8105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:07,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {8105#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:07,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {8105#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:07,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {8106#(<= main_~i~0 3)} assume true; {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:07,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {8106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:07,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {8106#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:07,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {8106#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:07,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {8107#(<= main_~i~0 4)} assume true; {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:07,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {8107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:07,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {8107#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:07,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {8107#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:07,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {8108#(<= main_~i~0 5)} assume true; {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:07,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:07,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {8108#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:07,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {8108#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:07,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {8109#(<= main_~i~0 6)} assume true; {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:07,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {8109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:07,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {8109#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:07,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {8109#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:07,646 INFO L273 TraceCheckUtils]: 34: Hoare triple {8110#(<= main_~i~0 7)} assume true; {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:07,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {8110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:07,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {8110#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:07,648 INFO L273 TraceCheckUtils]: 37: Hoare triple {8110#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:07,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {8111#(<= main_~i~0 8)} assume true; {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:07,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {8111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:07,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {8111#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:07,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {8111#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:07,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {8112#(<= main_~i~0 9)} assume true; {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:07,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {8112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:07,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {8112#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:07,652 INFO L273 TraceCheckUtils]: 45: Hoare triple {8112#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:07,653 INFO L273 TraceCheckUtils]: 46: Hoare triple {8113#(<= main_~i~0 10)} assume true; {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:07,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {8113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:07,654 INFO L273 TraceCheckUtils]: 48: Hoare triple {8113#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:07,654 INFO L273 TraceCheckUtils]: 49: Hoare triple {8113#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:07,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {8114#(<= main_~i~0 11)} assume true; {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:07,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {8114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:07,656 INFO L273 TraceCheckUtils]: 52: Hoare triple {8114#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:07,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {8114#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:07,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {8115#(<= main_~i~0 12)} assume true; {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:07,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {8115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:07,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {8115#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:07,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {8115#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:07,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {8116#(<= main_~i~0 13)} assume true; {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:07,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {8116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:07,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {8116#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:07,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {8116#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:07,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {8117#(<= main_~i~0 14)} assume true; {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:07,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {8117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:07,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {8117#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:07,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {8117#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:07,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {8118#(<= main_~i~0 15)} assume true; {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:07,664 INFO L273 TraceCheckUtils]: 67: Hoare triple {8118#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:07,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {8118#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:07,665 INFO L273 TraceCheckUtils]: 69: Hoare triple {8118#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:07,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {8119#(<= main_~i~0 16)} assume true; {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:07,666 INFO L273 TraceCheckUtils]: 71: Hoare triple {8119#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:07,667 INFO L273 TraceCheckUtils]: 72: Hoare triple {8119#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:07,667 INFO L273 TraceCheckUtils]: 73: Hoare triple {8119#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8120#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:07,668 INFO L273 TraceCheckUtils]: 74: Hoare triple {8120#(<= main_~i~0 17)} assume true; {8120#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:07,668 INFO L273 TraceCheckUtils]: 75: Hoare triple {8120#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8102#false} is VALID [2018-11-18 22:57:07,669 INFO L273 TraceCheckUtils]: 76: Hoare triple {8102#false} havoc ~x~0;~x~0 := 0; {8102#false} is VALID [2018-11-18 22:57:07,669 INFO L273 TraceCheckUtils]: 77: Hoare triple {8102#false} assume true; {8102#false} is VALID [2018-11-18 22:57:07,669 INFO L273 TraceCheckUtils]: 78: Hoare triple {8102#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {8102#false} is VALID [2018-11-18 22:57:07,669 INFO L256 TraceCheckUtils]: 79: Hoare triple {8102#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8102#false} is VALID [2018-11-18 22:57:07,669 INFO L273 TraceCheckUtils]: 80: Hoare triple {8102#false} ~cond := #in~cond; {8102#false} is VALID [2018-11-18 22:57:07,670 INFO L273 TraceCheckUtils]: 81: Hoare triple {8102#false} assume 0 == ~cond; {8102#false} is VALID [2018-11-18 22:57:07,670 INFO L273 TraceCheckUtils]: 82: Hoare triple {8102#false} assume !false; {8102#false} is VALID [2018-11-18 22:57:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:07,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:07,676 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-18 22:57:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:57:08,009 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:57:08,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:08,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:08,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {8101#true} call ULTIMATE.init(); {8101#true} is VALID [2018-11-18 22:57:08,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {8101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8101#true} is VALID [2018-11-18 22:57:08,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {8101#true} assume true; {8101#true} is VALID [2018-11-18 22:57:08,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8101#true} {8101#true} #73#return; {8101#true} is VALID [2018-11-18 22:57:08,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {8101#true} call #t~ret7 := main(); {8101#true} is VALID [2018-11-18 22:57:08,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {8101#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8139#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:08,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {8139#(<= main_~i~0 0)} assume true; {8139#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:08,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {8139#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8139#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:08,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {8139#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8139#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:08,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {8139#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {8104#(<= main_~i~0 1)} assume true; {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {8104#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {8104#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8104#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:08,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {8104#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {8105#(<= main_~i~0 2)} assume true; {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {8105#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {8105#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8105#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:08,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {8105#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {8106#(<= main_~i~0 3)} assume true; {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {8106#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {8106#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8106#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:08,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {8106#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {8107#(<= main_~i~0 4)} assume true; {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {8107#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {8107#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8107#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:08,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {8107#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {8108#(<= main_~i~0 5)} assume true; {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {8108#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8108#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:08,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {8108#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {8109#(<= main_~i~0 6)} assume true; {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {8109#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,369 INFO L273 TraceCheckUtils]: 32: Hoare triple {8109#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8109#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:08,369 INFO L273 TraceCheckUtils]: 33: Hoare triple {8109#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {8110#(<= main_~i~0 7)} assume true; {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,371 INFO L273 TraceCheckUtils]: 35: Hoare triple {8110#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {8110#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8110#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:08,372 INFO L273 TraceCheckUtils]: 37: Hoare triple {8110#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {8111#(<= main_~i~0 8)} assume true; {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {8111#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {8111#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8111#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:08,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {8111#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {8112#(<= main_~i~0 9)} assume true; {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {8112#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {8112#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8112#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:08,376 INFO L273 TraceCheckUtils]: 45: Hoare triple {8112#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {8113#(<= main_~i~0 10)} assume true; {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,377 INFO L273 TraceCheckUtils]: 47: Hoare triple {8113#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {8113#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8113#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:08,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {8113#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,379 INFO L273 TraceCheckUtils]: 50: Hoare triple {8114#(<= main_~i~0 11)} assume true; {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {8114#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,380 INFO L273 TraceCheckUtils]: 52: Hoare triple {8114#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8114#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:08,381 INFO L273 TraceCheckUtils]: 53: Hoare triple {8114#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {8115#(<= main_~i~0 12)} assume true; {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {8115#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,382 INFO L273 TraceCheckUtils]: 56: Hoare triple {8115#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8115#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:08,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {8115#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {8116#(<= main_~i~0 13)} assume true; {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {8116#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,385 INFO L273 TraceCheckUtils]: 60: Hoare triple {8116#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8116#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:08,385 INFO L273 TraceCheckUtils]: 61: Hoare triple {8116#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,386 INFO L273 TraceCheckUtils]: 62: Hoare triple {8117#(<= main_~i~0 14)} assume true; {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,386 INFO L273 TraceCheckUtils]: 63: Hoare triple {8117#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,387 INFO L273 TraceCheckUtils]: 64: Hoare triple {8117#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8117#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:08,388 INFO L273 TraceCheckUtils]: 65: Hoare triple {8117#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,388 INFO L273 TraceCheckUtils]: 66: Hoare triple {8118#(<= main_~i~0 15)} assume true; {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {8118#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,389 INFO L273 TraceCheckUtils]: 68: Hoare triple {8118#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8118#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:08,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {8118#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,391 INFO L273 TraceCheckUtils]: 70: Hoare triple {8119#(<= main_~i~0 16)} assume true; {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,391 INFO L273 TraceCheckUtils]: 71: Hoare triple {8119#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,392 INFO L273 TraceCheckUtils]: 72: Hoare triple {8119#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8119#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:08,392 INFO L273 TraceCheckUtils]: 73: Hoare triple {8119#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8120#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:08,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {8120#(<= main_~i~0 17)} assume true; {8120#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:08,393 INFO L273 TraceCheckUtils]: 75: Hoare triple {8120#(<= main_~i~0 17)} assume !(~i~0 < 100000); {8102#false} is VALID [2018-11-18 22:57:08,394 INFO L273 TraceCheckUtils]: 76: Hoare triple {8102#false} havoc ~x~0;~x~0 := 0; {8102#false} is VALID [2018-11-18 22:57:08,394 INFO L273 TraceCheckUtils]: 77: Hoare triple {8102#false} assume true; {8102#false} is VALID [2018-11-18 22:57:08,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {8102#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {8102#false} is VALID [2018-11-18 22:57:08,394 INFO L256 TraceCheckUtils]: 79: Hoare triple {8102#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8102#false} is VALID [2018-11-18 22:57:08,394 INFO L273 TraceCheckUtils]: 80: Hoare triple {8102#false} ~cond := #in~cond; {8102#false} is VALID [2018-11-18 22:57:08,395 INFO L273 TraceCheckUtils]: 81: Hoare triple {8102#false} assume 0 == ~cond; {8102#false} is VALID [2018-11-18 22:57:08,395 INFO L273 TraceCheckUtils]: 82: Hoare triple {8102#false} assume !false; {8102#false} is VALID [2018-11-18 22:57:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:08,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:08,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:57:08,420 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-18 22:57:08,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:08,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:57:08,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:57:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:57:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:57:08,502 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 21 states. [2018-11-18 22:57:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:09,178 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2018-11-18 22:57:09,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:57:09,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 83 [2018-11-18 22:57:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:57:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2018-11-18 22:57:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:57:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 143 transitions. [2018-11-18 22:57:09,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 143 transitions. [2018-11-18 22:57:09,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:09,321 INFO L225 Difference]: With dead ends: 118 [2018-11-18 22:57:09,321 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 22:57:09,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:57:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 22:57:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-18 22:57:09,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:09,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-18 22:57:09,340 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-18 22:57:09,341 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-18 22:57:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:09,343 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2018-11-18 22:57:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-11-18 22:57:09,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:09,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:09,343 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-18 22:57:09,344 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-18 22:57:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:09,346 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2018-11-18 22:57:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2018-11-18 22:57:09,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:09,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:09,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:09,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 22:57:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-18 22:57:09,349 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 83 [2018-11-18 22:57:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:09,349 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-18 22:57:09,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:57:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-18 22:57:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 22:57:09,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:09,350 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:09,350 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:09,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1312433296, now seen corresponding path program 18 times [2018-11-18 22:57:09,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:09,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:09,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:09,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:09,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:09,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2018-11-18 22:57:09,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {8847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8847#true} is VALID [2018-11-18 22:57:09,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2018-11-18 22:57:09,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #73#return; {8847#true} is VALID [2018-11-18 22:57:09,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret7 := main(); {8847#true} is VALID [2018-11-18 22:57:09,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {8847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8849#(= main_~i~0 0)} is VALID [2018-11-18 22:57:09,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {8849#(= main_~i~0 0)} assume true; {8849#(= main_~i~0 0)} is VALID [2018-11-18 22:57:09,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {8849#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8849#(= main_~i~0 0)} is VALID [2018-11-18 22:57:09,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {8849#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8849#(= main_~i~0 0)} is VALID [2018-11-18 22:57:09,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {8849#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {8850#(<= main_~i~0 1)} assume true; {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {8850#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {8850#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:09,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {8850#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {8851#(<= main_~i~0 2)} assume true; {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {8851#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {8851#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:09,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {8851#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {8852#(<= main_~i~0 3)} assume true; {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {8852#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {8852#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:09,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {8852#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {8853#(<= main_~i~0 4)} assume true; {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {8853#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {8853#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:09,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {8853#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {8854#(<= main_~i~0 5)} assume true; {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {8854#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {8854#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:09,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {8854#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {8855#(<= main_~i~0 6)} assume true; {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {8855#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {8855#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:09,853 INFO L273 TraceCheckUtils]: 33: Hoare triple {8855#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {8856#(<= main_~i~0 7)} assume true; {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {8856#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,854 INFO L273 TraceCheckUtils]: 36: Hoare triple {8856#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:09,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {8856#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {8857#(<= main_~i~0 8)} assume true; {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,855 INFO L273 TraceCheckUtils]: 39: Hoare triple {8857#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {8857#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:09,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {8857#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {8858#(<= main_~i~0 9)} assume true; {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {8858#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {8858#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:09,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {8858#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {8859#(<= main_~i~0 10)} assume true; {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {8859#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {8859#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:09,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {8859#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {8860#(<= main_~i~0 11)} assume true; {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {8860#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {8860#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:09,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {8860#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {8861#(<= main_~i~0 12)} assume true; {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,864 INFO L273 TraceCheckUtils]: 55: Hoare triple {8861#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,864 INFO L273 TraceCheckUtils]: 56: Hoare triple {8861#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:09,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {8861#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,866 INFO L273 TraceCheckUtils]: 58: Hoare triple {8862#(<= main_~i~0 13)} assume true; {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {8862#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,867 INFO L273 TraceCheckUtils]: 60: Hoare triple {8862#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:09,867 INFO L273 TraceCheckUtils]: 61: Hoare triple {8862#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,868 INFO L273 TraceCheckUtils]: 62: Hoare triple {8863#(<= main_~i~0 14)} assume true; {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,868 INFO L273 TraceCheckUtils]: 63: Hoare triple {8863#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,869 INFO L273 TraceCheckUtils]: 64: Hoare triple {8863#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:09,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {8863#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {8864#(<= main_~i~0 15)} assume true; {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,871 INFO L273 TraceCheckUtils]: 67: Hoare triple {8864#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,871 INFO L273 TraceCheckUtils]: 68: Hoare triple {8864#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:09,872 INFO L273 TraceCheckUtils]: 69: Hoare triple {8864#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,872 INFO L273 TraceCheckUtils]: 70: Hoare triple {8865#(<= main_~i~0 16)} assume true; {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,873 INFO L273 TraceCheckUtils]: 71: Hoare triple {8865#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,874 INFO L273 TraceCheckUtils]: 72: Hoare triple {8865#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:09,874 INFO L273 TraceCheckUtils]: 73: Hoare triple {8865#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,875 INFO L273 TraceCheckUtils]: 74: Hoare triple {8866#(<= main_~i~0 17)} assume true; {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,875 INFO L273 TraceCheckUtils]: 75: Hoare triple {8866#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,876 INFO L273 TraceCheckUtils]: 76: Hoare triple {8866#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:09,877 INFO L273 TraceCheckUtils]: 77: Hoare triple {8866#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8867#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:09,877 INFO L273 TraceCheckUtils]: 78: Hoare triple {8867#(<= main_~i~0 18)} assume true; {8867#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:09,878 INFO L273 TraceCheckUtils]: 79: Hoare triple {8867#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8848#false} is VALID [2018-11-18 22:57:09,878 INFO L273 TraceCheckUtils]: 80: Hoare triple {8848#false} havoc ~x~0;~x~0 := 0; {8848#false} is VALID [2018-11-18 22:57:09,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {8848#false} assume true; {8848#false} is VALID [2018-11-18 22:57:09,878 INFO L273 TraceCheckUtils]: 82: Hoare triple {8848#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {8848#false} is VALID [2018-11-18 22:57:09,879 INFO L256 TraceCheckUtils]: 83: Hoare triple {8848#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8848#false} is VALID [2018-11-18 22:57:09,879 INFO L273 TraceCheckUtils]: 84: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2018-11-18 22:57:09,879 INFO L273 TraceCheckUtils]: 85: Hoare triple {8848#false} assume 0 == ~cond; {8848#false} is VALID [2018-11-18 22:57:09,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2018-11-18 22:57:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:09,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:09,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:09,897 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:57:10,273 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-18 22:57:10,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:10,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:10,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2018-11-18 22:57:10,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {8847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8847#true} is VALID [2018-11-18 22:57:10,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2018-11-18 22:57:10,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #73#return; {8847#true} is VALID [2018-11-18 22:57:10,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret7 := main(); {8847#true} is VALID [2018-11-18 22:57:10,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {8847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8886#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:10,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {8886#(<= main_~i~0 0)} assume true; {8886#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:10,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {8886#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8886#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:10,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {8886#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8886#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:10,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {8886#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:10,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {8850#(<= main_~i~0 1)} assume true; {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:10,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {8850#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:10,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {8850#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8850#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:10,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {8850#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:10,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {8851#(<= main_~i~0 2)} assume true; {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:10,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {8851#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:10,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {8851#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8851#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:10,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {8851#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:10,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {8852#(<= main_~i~0 3)} assume true; {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:10,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {8852#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:10,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {8852#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8852#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:10,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {8852#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:10,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {8853#(<= main_~i~0 4)} assume true; {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:10,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {8853#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:10,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {8853#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8853#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:10,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {8853#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:10,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {8854#(<= main_~i~0 5)} assume true; {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:10,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {8854#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:10,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {8854#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8854#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:10,551 INFO L273 TraceCheckUtils]: 29: Hoare triple {8854#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:10,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {8855#(<= main_~i~0 6)} assume true; {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:10,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {8855#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:10,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {8855#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8855#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:10,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {8855#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:10,554 INFO L273 TraceCheckUtils]: 34: Hoare triple {8856#(<= main_~i~0 7)} assume true; {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:10,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {8856#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:10,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {8856#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8856#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:10,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {8856#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:10,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {8857#(<= main_~i~0 8)} assume true; {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:10,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {8857#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:10,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {8857#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8857#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:10,558 INFO L273 TraceCheckUtils]: 41: Hoare triple {8857#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:10,558 INFO L273 TraceCheckUtils]: 42: Hoare triple {8858#(<= main_~i~0 9)} assume true; {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:10,559 INFO L273 TraceCheckUtils]: 43: Hoare triple {8858#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:10,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {8858#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8858#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:10,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {8858#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:10,561 INFO L273 TraceCheckUtils]: 46: Hoare triple {8859#(<= main_~i~0 10)} assume true; {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:10,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {8859#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:10,562 INFO L273 TraceCheckUtils]: 48: Hoare triple {8859#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8859#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:10,562 INFO L273 TraceCheckUtils]: 49: Hoare triple {8859#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:10,563 INFO L273 TraceCheckUtils]: 50: Hoare triple {8860#(<= main_~i~0 11)} assume true; {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:10,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {8860#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:10,564 INFO L273 TraceCheckUtils]: 52: Hoare triple {8860#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8860#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:10,565 INFO L273 TraceCheckUtils]: 53: Hoare triple {8860#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:10,565 INFO L273 TraceCheckUtils]: 54: Hoare triple {8861#(<= main_~i~0 12)} assume true; {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:10,566 INFO L273 TraceCheckUtils]: 55: Hoare triple {8861#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:10,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {8861#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8861#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:10,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {8861#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:10,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {8862#(<= main_~i~0 13)} assume true; {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:10,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {8862#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:10,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {8862#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8862#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:10,569 INFO L273 TraceCheckUtils]: 61: Hoare triple {8862#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:10,570 INFO L273 TraceCheckUtils]: 62: Hoare triple {8863#(<= main_~i~0 14)} assume true; {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:10,570 INFO L273 TraceCheckUtils]: 63: Hoare triple {8863#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:10,571 INFO L273 TraceCheckUtils]: 64: Hoare triple {8863#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8863#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:10,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {8863#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:10,572 INFO L273 TraceCheckUtils]: 66: Hoare triple {8864#(<= main_~i~0 15)} assume true; {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:10,573 INFO L273 TraceCheckUtils]: 67: Hoare triple {8864#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:10,573 INFO L273 TraceCheckUtils]: 68: Hoare triple {8864#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8864#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:10,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {8864#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:10,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {8865#(<= main_~i~0 16)} assume true; {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:10,575 INFO L273 TraceCheckUtils]: 71: Hoare triple {8865#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:10,575 INFO L273 TraceCheckUtils]: 72: Hoare triple {8865#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8865#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:10,576 INFO L273 TraceCheckUtils]: 73: Hoare triple {8865#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:10,577 INFO L273 TraceCheckUtils]: 74: Hoare triple {8866#(<= main_~i~0 17)} assume true; {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:10,577 INFO L273 TraceCheckUtils]: 75: Hoare triple {8866#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:10,578 INFO L273 TraceCheckUtils]: 76: Hoare triple {8866#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8866#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:10,578 INFO L273 TraceCheckUtils]: 77: Hoare triple {8866#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8867#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:10,579 INFO L273 TraceCheckUtils]: 78: Hoare triple {8867#(<= main_~i~0 18)} assume true; {8867#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:10,579 INFO L273 TraceCheckUtils]: 79: Hoare triple {8867#(<= main_~i~0 18)} assume !(~i~0 < 100000); {8848#false} is VALID [2018-11-18 22:57:10,580 INFO L273 TraceCheckUtils]: 80: Hoare triple {8848#false} havoc ~x~0;~x~0 := 0; {8848#false} is VALID [2018-11-18 22:57:10,580 INFO L273 TraceCheckUtils]: 81: Hoare triple {8848#false} assume true; {8848#false} is VALID [2018-11-18 22:57:10,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {8848#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {8848#false} is VALID [2018-11-18 22:57:10,580 INFO L256 TraceCheckUtils]: 83: Hoare triple {8848#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8848#false} is VALID [2018-11-18 22:57:10,580 INFO L273 TraceCheckUtils]: 84: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2018-11-18 22:57:10,581 INFO L273 TraceCheckUtils]: 85: Hoare triple {8848#false} assume 0 == ~cond; {8848#false} is VALID [2018-11-18 22:57:10,581 INFO L273 TraceCheckUtils]: 86: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2018-11-18 22:57:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:10,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:10,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-18 22:57:10,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-18 22:57:10,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:10,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:57:10,693 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-18 22:57:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:57:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:57:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:57:10,694 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 22 states. [2018-11-18 22:57:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:11,290 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2018-11-18 22:57:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:57:11,290 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-18 22:57:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:57:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2018-11-18 22:57:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:57:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 148 transitions. [2018-11-18 22:57:11,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 148 transitions. [2018-11-18 22:57:11,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:11,424 INFO L225 Difference]: With dead ends: 122 [2018-11-18 22:57:11,424 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 22:57:11,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:57:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 22:57:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-18 22:57:11,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:11,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 102 states. [2018-11-18 22:57:11,446 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 102 states. [2018-11-18 22:57:11,446 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 102 states. [2018-11-18 22:57:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:11,448 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-18 22:57:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2018-11-18 22:57:11,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:11,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:11,448 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 104 states. [2018-11-18 22:57:11,448 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 104 states. [2018-11-18 22:57:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:11,450 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-18 22:57:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2018-11-18 22:57:11,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:11,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:11,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:11,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 22:57:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-11-18 22:57:11,452 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 87 [2018-11-18 22:57:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:11,452 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-11-18 22:57:11,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:57:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-18 22:57:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 22:57:11,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:11,453 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:11,453 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:11,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash 13194887, now seen corresponding path program 19 times [2018-11-18 22:57:11,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:11,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:11,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:11,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:11,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:11,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {9624#true} call ULTIMATE.init(); {9624#true} is VALID [2018-11-18 22:57:11,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {9624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9624#true} is VALID [2018-11-18 22:57:11,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {9624#true} assume true; {9624#true} is VALID [2018-11-18 22:57:11,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9624#true} {9624#true} #73#return; {9624#true} is VALID [2018-11-18 22:57:11,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {9624#true} call #t~ret7 := main(); {9624#true} is VALID [2018-11-18 22:57:11,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {9624#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9626#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {9626#(= main_~i~0 0)} assume true; {9626#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {9626#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9626#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {9626#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9626#(= main_~i~0 0)} is VALID [2018-11-18 22:57:11,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {9626#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {9627#(<= main_~i~0 1)} assume true; {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {9627#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {9627#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:11,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {9627#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {9628#(<= main_~i~0 2)} assume true; {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {9628#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {9628#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:11,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {9628#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {9629#(<= main_~i~0 3)} assume true; {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {9629#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {9629#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:11,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {9629#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {9630#(<= main_~i~0 4)} assume true; {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {9630#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {9630#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:11,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {9630#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {9631#(<= main_~i~0 5)} assume true; {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {9631#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {9631#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:11,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {9631#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {9632#(<= main_~i~0 6)} assume true; {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {9632#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {9632#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:11,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {9632#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {9633#(<= main_~i~0 7)} assume true; {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {9633#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {9633#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:11,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {9633#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {9634#(<= main_~i~0 8)} assume true; {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {9634#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {9634#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:11,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {9634#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {9635#(<= main_~i~0 9)} assume true; {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,849 INFO L273 TraceCheckUtils]: 43: Hoare triple {9635#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {9635#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:11,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {9635#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {9636#(<= main_~i~0 10)} assume true; {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {9636#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {9636#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:11,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {9636#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {9637#(<= main_~i~0 11)} assume true; {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {9637#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {9637#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:11,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {9637#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {9638#(<= main_~i~0 12)} assume true; {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {9638#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {9638#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:11,857 INFO L273 TraceCheckUtils]: 57: Hoare triple {9638#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {9639#(<= main_~i~0 13)} assume true; {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,858 INFO L273 TraceCheckUtils]: 59: Hoare triple {9639#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {9639#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:11,859 INFO L273 TraceCheckUtils]: 61: Hoare triple {9639#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,859 INFO L273 TraceCheckUtils]: 62: Hoare triple {9640#(<= main_~i~0 14)} assume true; {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,860 INFO L273 TraceCheckUtils]: 63: Hoare triple {9640#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,860 INFO L273 TraceCheckUtils]: 64: Hoare triple {9640#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:11,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {9640#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {9641#(<= main_~i~0 15)} assume true; {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,862 INFO L273 TraceCheckUtils]: 67: Hoare triple {9641#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,863 INFO L273 TraceCheckUtils]: 68: Hoare triple {9641#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:11,863 INFO L273 TraceCheckUtils]: 69: Hoare triple {9641#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,864 INFO L273 TraceCheckUtils]: 70: Hoare triple {9642#(<= main_~i~0 16)} assume true; {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {9642#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,865 INFO L273 TraceCheckUtils]: 72: Hoare triple {9642#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:11,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {9642#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,866 INFO L273 TraceCheckUtils]: 74: Hoare triple {9643#(<= main_~i~0 17)} assume true; {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,867 INFO L273 TraceCheckUtils]: 75: Hoare triple {9643#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,867 INFO L273 TraceCheckUtils]: 76: Hoare triple {9643#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:11,868 INFO L273 TraceCheckUtils]: 77: Hoare triple {9643#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,869 INFO L273 TraceCheckUtils]: 78: Hoare triple {9644#(<= main_~i~0 18)} assume true; {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,869 INFO L273 TraceCheckUtils]: 79: Hoare triple {9644#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,870 INFO L273 TraceCheckUtils]: 80: Hoare triple {9644#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:11,870 INFO L273 TraceCheckUtils]: 81: Hoare triple {9644#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9645#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:11,871 INFO L273 TraceCheckUtils]: 82: Hoare triple {9645#(<= main_~i~0 19)} assume true; {9645#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:11,871 INFO L273 TraceCheckUtils]: 83: Hoare triple {9645#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9625#false} is VALID [2018-11-18 22:57:11,872 INFO L273 TraceCheckUtils]: 84: Hoare triple {9625#false} havoc ~x~0;~x~0 := 0; {9625#false} is VALID [2018-11-18 22:57:11,872 INFO L273 TraceCheckUtils]: 85: Hoare triple {9625#false} assume true; {9625#false} is VALID [2018-11-18 22:57:11,872 INFO L273 TraceCheckUtils]: 86: Hoare triple {9625#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {9625#false} is VALID [2018-11-18 22:57:11,872 INFO L256 TraceCheckUtils]: 87: Hoare triple {9625#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9625#false} is VALID [2018-11-18 22:57:11,873 INFO L273 TraceCheckUtils]: 88: Hoare triple {9625#false} ~cond := #in~cond; {9625#false} is VALID [2018-11-18 22:57:11,873 INFO L273 TraceCheckUtils]: 89: Hoare triple {9625#false} assume 0 == ~cond; {9625#false} is VALID [2018-11-18 22:57:11,873 INFO L273 TraceCheckUtils]: 90: Hoare triple {9625#false} assume !false; {9625#false} is VALID [2018-11-18 22:57:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:11,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:11,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:11,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:11,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:12,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {9624#true} call ULTIMATE.init(); {9624#true} is VALID [2018-11-18 22:57:12,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {9624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9624#true} is VALID [2018-11-18 22:57:12,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {9624#true} assume true; {9624#true} is VALID [2018-11-18 22:57:12,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9624#true} {9624#true} #73#return; {9624#true} is VALID [2018-11-18 22:57:12,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {9624#true} call #t~ret7 := main(); {9624#true} is VALID [2018-11-18 22:57:12,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {9624#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9664#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {9664#(<= main_~i~0 0)} assume true; {9664#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {9664#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9664#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {9664#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9664#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:12,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {9664#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {9627#(<= main_~i~0 1)} assume true; {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {9627#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {9627#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9627#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:12,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {9627#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {9628#(<= main_~i~0 2)} assume true; {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {9628#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {9628#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9628#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:12,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {9628#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {9629#(<= main_~i~0 3)} assume true; {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {9629#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {9629#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9629#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:12,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {9629#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,163 INFO L273 TraceCheckUtils]: 22: Hoare triple {9630#(<= main_~i~0 4)} assume true; {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {9630#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {9630#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9630#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:12,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {9630#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {9631#(<= main_~i~0 5)} assume true; {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {9631#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {9631#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9631#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:12,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {9631#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {9632#(<= main_~i~0 6)} assume true; {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {9632#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {9632#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9632#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:12,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {9632#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,170 INFO L273 TraceCheckUtils]: 34: Hoare triple {9633#(<= main_~i~0 7)} assume true; {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {9633#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {9633#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9633#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:12,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {9633#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {9634#(<= main_~i~0 8)} assume true; {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,173 INFO L273 TraceCheckUtils]: 39: Hoare triple {9634#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {9634#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9634#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:12,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {9634#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {9635#(<= main_~i~0 9)} assume true; {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {9635#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,176 INFO L273 TraceCheckUtils]: 44: Hoare triple {9635#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9635#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:12,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {9635#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,177 INFO L273 TraceCheckUtils]: 46: Hoare triple {9636#(<= main_~i~0 10)} assume true; {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,178 INFO L273 TraceCheckUtils]: 47: Hoare triple {9636#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,178 INFO L273 TraceCheckUtils]: 48: Hoare triple {9636#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9636#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:12,179 INFO L273 TraceCheckUtils]: 49: Hoare triple {9636#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {9637#(<= main_~i~0 11)} assume true; {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,180 INFO L273 TraceCheckUtils]: 51: Hoare triple {9637#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,180 INFO L273 TraceCheckUtils]: 52: Hoare triple {9637#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9637#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:12,181 INFO L273 TraceCheckUtils]: 53: Hoare triple {9637#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,182 INFO L273 TraceCheckUtils]: 54: Hoare triple {9638#(<= main_~i~0 12)} assume true; {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,182 INFO L273 TraceCheckUtils]: 55: Hoare triple {9638#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {9638#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9638#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:12,183 INFO L273 TraceCheckUtils]: 57: Hoare triple {9638#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,184 INFO L273 TraceCheckUtils]: 58: Hoare triple {9639#(<= main_~i~0 13)} assume true; {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,184 INFO L273 TraceCheckUtils]: 59: Hoare triple {9639#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,185 INFO L273 TraceCheckUtils]: 60: Hoare triple {9639#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9639#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:12,186 INFO L273 TraceCheckUtils]: 61: Hoare triple {9639#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,186 INFO L273 TraceCheckUtils]: 62: Hoare triple {9640#(<= main_~i~0 14)} assume true; {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {9640#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {9640#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9640#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:12,188 INFO L273 TraceCheckUtils]: 65: Hoare triple {9640#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {9641#(<= main_~i~0 15)} assume true; {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,189 INFO L273 TraceCheckUtils]: 67: Hoare triple {9641#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,189 INFO L273 TraceCheckUtils]: 68: Hoare triple {9641#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9641#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:12,190 INFO L273 TraceCheckUtils]: 69: Hoare triple {9641#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,191 INFO L273 TraceCheckUtils]: 70: Hoare triple {9642#(<= main_~i~0 16)} assume true; {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,191 INFO L273 TraceCheckUtils]: 71: Hoare triple {9642#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,192 INFO L273 TraceCheckUtils]: 72: Hoare triple {9642#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9642#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:12,192 INFO L273 TraceCheckUtils]: 73: Hoare triple {9642#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,193 INFO L273 TraceCheckUtils]: 74: Hoare triple {9643#(<= main_~i~0 17)} assume true; {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,193 INFO L273 TraceCheckUtils]: 75: Hoare triple {9643#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,194 INFO L273 TraceCheckUtils]: 76: Hoare triple {9643#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9643#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:12,195 INFO L273 TraceCheckUtils]: 77: Hoare triple {9643#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,195 INFO L273 TraceCheckUtils]: 78: Hoare triple {9644#(<= main_~i~0 18)} assume true; {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,196 INFO L273 TraceCheckUtils]: 79: Hoare triple {9644#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,196 INFO L273 TraceCheckUtils]: 80: Hoare triple {9644#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9644#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:12,197 INFO L273 TraceCheckUtils]: 81: Hoare triple {9644#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9645#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:12,197 INFO L273 TraceCheckUtils]: 82: Hoare triple {9645#(<= main_~i~0 19)} assume true; {9645#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:12,198 INFO L273 TraceCheckUtils]: 83: Hoare triple {9645#(<= main_~i~0 19)} assume !(~i~0 < 100000); {9625#false} is VALID [2018-11-18 22:57:12,198 INFO L273 TraceCheckUtils]: 84: Hoare triple {9625#false} havoc ~x~0;~x~0 := 0; {9625#false} is VALID [2018-11-18 22:57:12,199 INFO L273 TraceCheckUtils]: 85: Hoare triple {9625#false} assume true; {9625#false} is VALID [2018-11-18 22:57:12,199 INFO L273 TraceCheckUtils]: 86: Hoare triple {9625#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {9625#false} is VALID [2018-11-18 22:57:12,199 INFO L256 TraceCheckUtils]: 87: Hoare triple {9625#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9625#false} is VALID [2018-11-18 22:57:12,199 INFO L273 TraceCheckUtils]: 88: Hoare triple {9625#false} ~cond := #in~cond; {9625#false} is VALID [2018-11-18 22:57:12,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {9625#false} assume 0 == ~cond; {9625#false} is VALID [2018-11-18 22:57:12,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {9625#false} assume !false; {9625#false} is VALID [2018-11-18 22:57:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:12,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:12,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:57:12,225 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-18 22:57:12,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:12,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:57:12,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:12,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:57:12,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:57:12,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:57:12,318 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 23 states. [2018-11-18 22:57:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:12,775 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2018-11-18 22:57:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:57:12,775 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-11-18 22:57:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:57:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 153 transitions. [2018-11-18 22:57:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:57:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 153 transitions. [2018-11-18 22:57:12,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 153 transitions. [2018-11-18 22:57:12,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:12,913 INFO L225 Difference]: With dead ends: 126 [2018-11-18 22:57:12,914 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 22:57:12,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:57:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 22:57:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-18 22:57:12,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:12,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 106 states. [2018-11-18 22:57:12,935 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 106 states. [2018-11-18 22:57:12,935 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 106 states. [2018-11-18 22:57:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:12,938 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-18 22:57:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-18 22:57:12,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:12,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:12,939 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 108 states. [2018-11-18 22:57:12,939 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 108 states. [2018-11-18 22:57:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:12,941 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-18 22:57:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-18 22:57:12,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:12,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:12,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:12,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 22:57:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2018-11-18 22:57:12,944 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 91 [2018-11-18 22:57:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:12,944 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2018-11-18 22:57:12,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:57:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2018-11-18 22:57:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-18 22:57:12,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:12,945 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:12,946 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:12,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash -589599202, now seen corresponding path program 20 times [2018-11-18 22:57:12,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:12,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:12,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:13,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {10432#true} call ULTIMATE.init(); {10432#true} is VALID [2018-11-18 22:57:13,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {10432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10432#true} is VALID [2018-11-18 22:57:13,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {10432#true} assume true; {10432#true} is VALID [2018-11-18 22:57:13,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10432#true} {10432#true} #73#return; {10432#true} is VALID [2018-11-18 22:57:13,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {10432#true} call #t~ret7 := main(); {10432#true} is VALID [2018-11-18 22:57:13,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {10432#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10434#(= main_~i~0 0)} is VALID [2018-11-18 22:57:13,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {10434#(= main_~i~0 0)} assume true; {10434#(= main_~i~0 0)} is VALID [2018-11-18 22:57:13,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {10434#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10434#(= main_~i~0 0)} is VALID [2018-11-18 22:57:13,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {10434#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10434#(= main_~i~0 0)} is VALID [2018-11-18 22:57:13,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {10434#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,402 INFO L273 TraceCheckUtils]: 10: Hoare triple {10435#(<= main_~i~0 1)} assume true; {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {10435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {10435#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {10435#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {10436#(<= main_~i~0 2)} assume true; {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {10436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {10436#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {10436#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {10437#(<= main_~i~0 3)} assume true; {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {10437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {10437#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {10437#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {10438#(<= main_~i~0 4)} assume true; {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {10438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {10438#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,409 INFO L273 TraceCheckUtils]: 25: Hoare triple {10438#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {10439#(<= main_~i~0 5)} assume true; {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {10439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {10439#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {10439#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {10440#(<= main_~i~0 6)} assume true; {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {10440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {10440#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {10440#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {10441#(<= main_~i~0 7)} assume true; {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {10441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {10441#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {10441#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {10442#(<= main_~i~0 8)} assume true; {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {10442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {10442#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {10442#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {10443#(<= main_~i~0 9)} assume true; {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {10443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {10443#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {10443#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {10444#(<= main_~i~0 10)} assume true; {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {10444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,421 INFO L273 TraceCheckUtils]: 48: Hoare triple {10444#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {10444#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {10445#(<= main_~i~0 11)} assume true; {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {10445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,423 INFO L273 TraceCheckUtils]: 52: Hoare triple {10445#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {10445#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {10446#(<= main_~i~0 12)} assume true; {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {10446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {10446#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,426 INFO L273 TraceCheckUtils]: 57: Hoare triple {10446#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,427 INFO L273 TraceCheckUtils]: 58: Hoare triple {10447#(<= main_~i~0 13)} assume true; {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {10447#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {10447#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {10447#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {10448#(<= main_~i~0 14)} assume true; {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {10448#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {10448#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {10448#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,431 INFO L273 TraceCheckUtils]: 66: Hoare triple {10449#(<= main_~i~0 15)} assume true; {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,431 INFO L273 TraceCheckUtils]: 67: Hoare triple {10449#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,432 INFO L273 TraceCheckUtils]: 68: Hoare triple {10449#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,432 INFO L273 TraceCheckUtils]: 69: Hoare triple {10449#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,433 INFO L273 TraceCheckUtils]: 70: Hoare triple {10450#(<= main_~i~0 16)} assume true; {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,433 INFO L273 TraceCheckUtils]: 71: Hoare triple {10450#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,434 INFO L273 TraceCheckUtils]: 72: Hoare triple {10450#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,435 INFO L273 TraceCheckUtils]: 73: Hoare triple {10450#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,435 INFO L273 TraceCheckUtils]: 74: Hoare triple {10451#(<= main_~i~0 17)} assume true; {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,436 INFO L273 TraceCheckUtils]: 75: Hoare triple {10451#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,436 INFO L273 TraceCheckUtils]: 76: Hoare triple {10451#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,437 INFO L273 TraceCheckUtils]: 77: Hoare triple {10451#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,437 INFO L273 TraceCheckUtils]: 78: Hoare triple {10452#(<= main_~i~0 18)} assume true; {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,438 INFO L273 TraceCheckUtils]: 79: Hoare triple {10452#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,438 INFO L273 TraceCheckUtils]: 80: Hoare triple {10452#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,439 INFO L273 TraceCheckUtils]: 81: Hoare triple {10452#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,439 INFO L273 TraceCheckUtils]: 82: Hoare triple {10453#(<= main_~i~0 19)} assume true; {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,440 INFO L273 TraceCheckUtils]: 83: Hoare triple {10453#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,440 INFO L273 TraceCheckUtils]: 84: Hoare triple {10453#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,441 INFO L273 TraceCheckUtils]: 85: Hoare triple {10453#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10454#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:13,441 INFO L273 TraceCheckUtils]: 86: Hoare triple {10454#(<= main_~i~0 20)} assume true; {10454#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:13,442 INFO L273 TraceCheckUtils]: 87: Hoare triple {10454#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-18 22:57:13,442 INFO L273 TraceCheckUtils]: 88: Hoare triple {10433#false} havoc ~x~0;~x~0 := 0; {10433#false} is VALID [2018-11-18 22:57:13,442 INFO L273 TraceCheckUtils]: 89: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-18 22:57:13,443 INFO L273 TraceCheckUtils]: 90: Hoare triple {10433#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {10433#false} is VALID [2018-11-18 22:57:13,443 INFO L256 TraceCheckUtils]: 91: Hoare triple {10433#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {10433#false} is VALID [2018-11-18 22:57:13,443 INFO L273 TraceCheckUtils]: 92: Hoare triple {10433#false} ~cond := #in~cond; {10433#false} is VALID [2018-11-18 22:57:13,443 INFO L273 TraceCheckUtils]: 93: Hoare triple {10433#false} assume 0 == ~cond; {10433#false} is VALID [2018-11-18 22:57:13,443 INFO L273 TraceCheckUtils]: 94: Hoare triple {10433#false} assume !false; {10433#false} is VALID [2018-11-18 22:57:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:13,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:13,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:13,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:13,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:13,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:13,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:13,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {10432#true} call ULTIMATE.init(); {10432#true} is VALID [2018-11-18 22:57:13,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {10432#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10432#true} is VALID [2018-11-18 22:57:13,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {10432#true} assume true; {10432#true} is VALID [2018-11-18 22:57:13,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10432#true} {10432#true} #73#return; {10432#true} is VALID [2018-11-18 22:57:13,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {10432#true} call #t~ret7 := main(); {10432#true} is VALID [2018-11-18 22:57:13,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {10432#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10473#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:13,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {10473#(<= main_~i~0 0)} assume true; {10473#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:13,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {10473#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10473#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:13,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {10473#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10473#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:13,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {10473#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {10435#(<= main_~i~0 1)} assume true; {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {10435#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {10435#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10435#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:13,735 INFO L273 TraceCheckUtils]: 13: Hoare triple {10435#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {10436#(<= main_~i~0 2)} assume true; {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {10436#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {10436#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10436#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:13,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {10436#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {10437#(<= main_~i~0 3)} assume true; {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {10437#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {10437#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10437#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:13,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {10437#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {10438#(<= main_~i~0 4)} assume true; {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {10438#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {10438#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10438#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:13,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {10438#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {10439#(<= main_~i~0 5)} assume true; {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {10439#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {10439#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10439#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:13,744 INFO L273 TraceCheckUtils]: 29: Hoare triple {10439#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {10440#(<= main_~i~0 6)} assume true; {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {10440#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {10440#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10440#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:13,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {10440#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {10441#(<= main_~i~0 7)} assume true; {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {10441#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {10441#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10441#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:13,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {10441#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {10442#(<= main_~i~0 8)} assume true; {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {10442#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {10442#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10442#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:13,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {10442#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {10443#(<= main_~i~0 9)} assume true; {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {10443#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {10443#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10443#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:13,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {10443#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {10444#(<= main_~i~0 10)} assume true; {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {10444#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {10444#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10444#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:13,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {10444#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {10445#(<= main_~i~0 11)} assume true; {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {10445#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {10445#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10445#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:13,756 INFO L273 TraceCheckUtils]: 53: Hoare triple {10445#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {10446#(<= main_~i~0 12)} assume true; {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,757 INFO L273 TraceCheckUtils]: 55: Hoare triple {10446#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {10446#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10446#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:13,759 INFO L273 TraceCheckUtils]: 57: Hoare triple {10446#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {10447#(<= main_~i~0 13)} assume true; {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,759 INFO L273 TraceCheckUtils]: 59: Hoare triple {10447#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,760 INFO L273 TraceCheckUtils]: 60: Hoare triple {10447#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10447#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:13,761 INFO L273 TraceCheckUtils]: 61: Hoare triple {10447#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,761 INFO L273 TraceCheckUtils]: 62: Hoare triple {10448#(<= main_~i~0 14)} assume true; {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,762 INFO L273 TraceCheckUtils]: 63: Hoare triple {10448#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,762 INFO L273 TraceCheckUtils]: 64: Hoare triple {10448#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10448#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:13,763 INFO L273 TraceCheckUtils]: 65: Hoare triple {10448#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,763 INFO L273 TraceCheckUtils]: 66: Hoare triple {10449#(<= main_~i~0 15)} assume true; {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,764 INFO L273 TraceCheckUtils]: 67: Hoare triple {10449#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,764 INFO L273 TraceCheckUtils]: 68: Hoare triple {10449#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10449#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:13,765 INFO L273 TraceCheckUtils]: 69: Hoare triple {10449#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,765 INFO L273 TraceCheckUtils]: 70: Hoare triple {10450#(<= main_~i~0 16)} assume true; {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,766 INFO L273 TraceCheckUtils]: 71: Hoare triple {10450#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,766 INFO L273 TraceCheckUtils]: 72: Hoare triple {10450#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10450#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:13,767 INFO L273 TraceCheckUtils]: 73: Hoare triple {10450#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,768 INFO L273 TraceCheckUtils]: 74: Hoare triple {10451#(<= main_~i~0 17)} assume true; {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,768 INFO L273 TraceCheckUtils]: 75: Hoare triple {10451#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,769 INFO L273 TraceCheckUtils]: 76: Hoare triple {10451#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10451#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:13,769 INFO L273 TraceCheckUtils]: 77: Hoare triple {10451#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,770 INFO L273 TraceCheckUtils]: 78: Hoare triple {10452#(<= main_~i~0 18)} assume true; {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,771 INFO L273 TraceCheckUtils]: 79: Hoare triple {10452#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,771 INFO L273 TraceCheckUtils]: 80: Hoare triple {10452#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10452#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:13,772 INFO L273 TraceCheckUtils]: 81: Hoare triple {10452#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,772 INFO L273 TraceCheckUtils]: 82: Hoare triple {10453#(<= main_~i~0 19)} assume true; {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,773 INFO L273 TraceCheckUtils]: 83: Hoare triple {10453#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,773 INFO L273 TraceCheckUtils]: 84: Hoare triple {10453#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10453#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:13,774 INFO L273 TraceCheckUtils]: 85: Hoare triple {10453#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10454#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:13,775 INFO L273 TraceCheckUtils]: 86: Hoare triple {10454#(<= main_~i~0 20)} assume true; {10454#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:13,775 INFO L273 TraceCheckUtils]: 87: Hoare triple {10454#(<= main_~i~0 20)} assume !(~i~0 < 100000); {10433#false} is VALID [2018-11-18 22:57:13,775 INFO L273 TraceCheckUtils]: 88: Hoare triple {10433#false} havoc ~x~0;~x~0 := 0; {10433#false} is VALID [2018-11-18 22:57:13,776 INFO L273 TraceCheckUtils]: 89: Hoare triple {10433#false} assume true; {10433#false} is VALID [2018-11-18 22:57:13,776 INFO L273 TraceCheckUtils]: 90: Hoare triple {10433#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {10433#false} is VALID [2018-11-18 22:57:13,776 INFO L256 TraceCheckUtils]: 91: Hoare triple {10433#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {10433#false} is VALID [2018-11-18 22:57:13,776 INFO L273 TraceCheckUtils]: 92: Hoare triple {10433#false} ~cond := #in~cond; {10433#false} is VALID [2018-11-18 22:57:13,776 INFO L273 TraceCheckUtils]: 93: Hoare triple {10433#false} assume 0 == ~cond; {10433#false} is VALID [2018-11-18 22:57:13,777 INFO L273 TraceCheckUtils]: 94: Hoare triple {10433#false} assume !false; {10433#false} is VALID [2018-11-18 22:57:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:13,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:13,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:57:13,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-18 22:57:13,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:13,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:57:13,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:13,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:57:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:57:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:57:13,953 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 24 states. [2018-11-18 22:57:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:14,550 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-11-18 22:57:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:57:14,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-11-18 22:57:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:57:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-18 22:57:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:57:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 158 transitions. [2018-11-18 22:57:14,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 158 transitions. [2018-11-18 22:57:14,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:14,712 INFO L225 Difference]: With dead ends: 130 [2018-11-18 22:57:14,712 INFO L226 Difference]: Without dead ends: 112 [2018-11-18 22:57:14,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:57:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-18 22:57:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-18 22:57:14,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:14,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2018-11-18 22:57:14,742 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2018-11-18 22:57:14,742 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2018-11-18 22:57:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:14,744 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-18 22:57:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-18 22:57:14,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:14,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:14,744 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2018-11-18 22:57:14,744 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2018-11-18 22:57:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:14,746 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-18 22:57:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-18 22:57:14,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:14,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:14,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:14,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 22:57:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2018-11-18 22:57:14,748 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 95 [2018-11-18 22:57:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:14,748 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2018-11-18 22:57:14,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:57:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2018-11-18 22:57:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 22:57:14,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:14,749 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:14,749 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:14,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1403395531, now seen corresponding path program 21 times [2018-11-18 22:57:14,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:14,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:16,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {11271#true} call ULTIMATE.init(); {11271#true} is VALID [2018-11-18 22:57:16,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {11271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11271#true} is VALID [2018-11-18 22:57:16,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {11271#true} assume true; {11271#true} is VALID [2018-11-18 22:57:16,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11271#true} {11271#true} #73#return; {11271#true} is VALID [2018-11-18 22:57:16,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {11271#true} call #t~ret7 := main(); {11271#true} is VALID [2018-11-18 22:57:16,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {11271#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {11273#(= main_~i~0 0)} is VALID [2018-11-18 22:57:16,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {11273#(= main_~i~0 0)} assume true; {11273#(= main_~i~0 0)} is VALID [2018-11-18 22:57:16,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {11273#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11273#(= main_~i~0 0)} is VALID [2018-11-18 22:57:16,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {11273#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11273#(= main_~i~0 0)} is VALID [2018-11-18 22:57:16,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {11273#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:16,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {11274#(<= main_~i~0 1)} assume true; {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:16,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {11274#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:16,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {11274#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:16,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {11274#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:16,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {11275#(<= main_~i~0 2)} assume true; {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:16,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {11275#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:16,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:16,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:16,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 3)} assume true; {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:16,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:16,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {11276#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:16,435 INFO L273 TraceCheckUtils]: 21: Hoare triple {11276#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:16,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {11277#(<= main_~i~0 4)} assume true; {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:16,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {11277#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:16,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {11277#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:16,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {11277#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:16,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {11278#(<= main_~i~0 5)} assume true; {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:16,438 INFO L273 TraceCheckUtils]: 27: Hoare triple {11278#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:16,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {11278#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:16,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {11278#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:16,440 INFO L273 TraceCheckUtils]: 30: Hoare triple {11279#(<= main_~i~0 6)} assume true; {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:16,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {11279#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:16,441 INFO L273 TraceCheckUtils]: 32: Hoare triple {11279#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:16,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {11279#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:16,443 INFO L273 TraceCheckUtils]: 34: Hoare triple {11280#(<= main_~i~0 7)} assume true; {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:16,443 INFO L273 TraceCheckUtils]: 35: Hoare triple {11280#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:16,444 INFO L273 TraceCheckUtils]: 36: Hoare triple {11280#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:16,444 INFO L273 TraceCheckUtils]: 37: Hoare triple {11280#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:16,445 INFO L273 TraceCheckUtils]: 38: Hoare triple {11281#(<= main_~i~0 8)} assume true; {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:16,445 INFO L273 TraceCheckUtils]: 39: Hoare triple {11281#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:16,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {11281#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:16,447 INFO L273 TraceCheckUtils]: 41: Hoare triple {11281#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:16,447 INFO L273 TraceCheckUtils]: 42: Hoare triple {11282#(<= main_~i~0 9)} assume true; {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:16,448 INFO L273 TraceCheckUtils]: 43: Hoare triple {11282#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:16,448 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:16,449 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:16,450 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 10)} assume true; {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:16,450 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:16,451 INFO L273 TraceCheckUtils]: 48: Hoare triple {11283#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:16,451 INFO L273 TraceCheckUtils]: 49: Hoare triple {11283#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:16,452 INFO L273 TraceCheckUtils]: 50: Hoare triple {11284#(<= main_~i~0 11)} assume true; {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:16,453 INFO L273 TraceCheckUtils]: 51: Hoare triple {11284#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:16,453 INFO L273 TraceCheckUtils]: 52: Hoare triple {11284#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:16,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {11284#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:16,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {11285#(<= main_~i~0 12)} assume true; {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:16,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {11285#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:16,455 INFO L273 TraceCheckUtils]: 56: Hoare triple {11285#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:16,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {11285#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:16,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {11286#(<= main_~i~0 13)} assume true; {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:16,457 INFO L273 TraceCheckUtils]: 59: Hoare triple {11286#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:16,458 INFO L273 TraceCheckUtils]: 60: Hoare triple {11286#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:16,458 INFO L273 TraceCheckUtils]: 61: Hoare triple {11286#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:16,459 INFO L273 TraceCheckUtils]: 62: Hoare triple {11287#(<= main_~i~0 14)} assume true; {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:16,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {11287#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:16,460 INFO L273 TraceCheckUtils]: 64: Hoare triple {11287#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:16,461 INFO L273 TraceCheckUtils]: 65: Hoare triple {11287#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:16,461 INFO L273 TraceCheckUtils]: 66: Hoare triple {11288#(<= main_~i~0 15)} assume true; {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:16,462 INFO L273 TraceCheckUtils]: 67: Hoare triple {11288#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:16,462 INFO L273 TraceCheckUtils]: 68: Hoare triple {11288#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:16,463 INFO L273 TraceCheckUtils]: 69: Hoare triple {11288#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:16,463 INFO L273 TraceCheckUtils]: 70: Hoare triple {11289#(<= main_~i~0 16)} assume true; {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:16,464 INFO L273 TraceCheckUtils]: 71: Hoare triple {11289#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:16,464 INFO L273 TraceCheckUtils]: 72: Hoare triple {11289#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:16,465 INFO L273 TraceCheckUtils]: 73: Hoare triple {11289#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:16,466 INFO L273 TraceCheckUtils]: 74: Hoare triple {11290#(<= main_~i~0 17)} assume true; {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:16,466 INFO L273 TraceCheckUtils]: 75: Hoare triple {11290#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:16,467 INFO L273 TraceCheckUtils]: 76: Hoare triple {11290#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:16,468 INFO L273 TraceCheckUtils]: 77: Hoare triple {11290#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:16,468 INFO L273 TraceCheckUtils]: 78: Hoare triple {11291#(<= main_~i~0 18)} assume true; {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:16,469 INFO L273 TraceCheckUtils]: 79: Hoare triple {11291#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:16,469 INFO L273 TraceCheckUtils]: 80: Hoare triple {11291#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:16,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {11291#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:16,470 INFO L273 TraceCheckUtils]: 82: Hoare triple {11292#(<= main_~i~0 19)} assume true; {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:16,471 INFO L273 TraceCheckUtils]: 83: Hoare triple {11292#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:16,471 INFO L273 TraceCheckUtils]: 84: Hoare triple {11292#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:16,472 INFO L273 TraceCheckUtils]: 85: Hoare triple {11292#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:16,473 INFO L273 TraceCheckUtils]: 86: Hoare triple {11293#(<= main_~i~0 20)} assume true; {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:16,473 INFO L273 TraceCheckUtils]: 87: Hoare triple {11293#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:16,474 INFO L273 TraceCheckUtils]: 88: Hoare triple {11293#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:16,474 INFO L273 TraceCheckUtils]: 89: Hoare triple {11293#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11294#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:16,475 INFO L273 TraceCheckUtils]: 90: Hoare triple {11294#(<= main_~i~0 21)} assume true; {11294#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:16,476 INFO L273 TraceCheckUtils]: 91: Hoare triple {11294#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11272#false} is VALID [2018-11-18 22:57:16,476 INFO L273 TraceCheckUtils]: 92: Hoare triple {11272#false} havoc ~x~0;~x~0 := 0; {11272#false} is VALID [2018-11-18 22:57:16,476 INFO L273 TraceCheckUtils]: 93: Hoare triple {11272#false} assume true; {11272#false} is VALID [2018-11-18 22:57:16,476 INFO L273 TraceCheckUtils]: 94: Hoare triple {11272#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {11272#false} is VALID [2018-11-18 22:57:16,477 INFO L256 TraceCheckUtils]: 95: Hoare triple {11272#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {11272#false} is VALID [2018-11-18 22:57:16,477 INFO L273 TraceCheckUtils]: 96: Hoare triple {11272#false} ~cond := #in~cond; {11272#false} is VALID [2018-11-18 22:57:16,477 INFO L273 TraceCheckUtils]: 97: Hoare triple {11272#false} assume 0 == ~cond; {11272#false} is VALID [2018-11-18 22:57:16,477 INFO L273 TraceCheckUtils]: 98: Hoare triple {11272#false} assume !false; {11272#false} is VALID [2018-11-18 22:57:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:16,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:16,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:16,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:17,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-18 22:57:17,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:17,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:17,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {11271#true} call ULTIMATE.init(); {11271#true} is VALID [2018-11-18 22:57:17,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {11271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11271#true} is VALID [2018-11-18 22:57:17,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {11271#true} assume true; {11271#true} is VALID [2018-11-18 22:57:17,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11271#true} {11271#true} #73#return; {11271#true} is VALID [2018-11-18 22:57:17,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {11271#true} call #t~ret7 := main(); {11271#true} is VALID [2018-11-18 22:57:17,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {11271#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {11313#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {11313#(<= main_~i~0 0)} assume true; {11313#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {11313#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11313#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {11313#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11313#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:17,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {11313#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {11274#(<= main_~i~0 1)} assume true; {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {11274#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {11274#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11274#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:17,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {11274#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {11275#(<= main_~i~0 2)} assume true; {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {11275#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11275#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:17,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 3)} assume true; {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {11276#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11276#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:17,388 INFO L273 TraceCheckUtils]: 21: Hoare triple {11276#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {11277#(<= main_~i~0 4)} assume true; {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {11277#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {11277#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11277#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:17,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {11277#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {11278#(<= main_~i~0 5)} assume true; {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {11278#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {11278#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11278#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:17,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {11278#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {11279#(<= main_~i~0 6)} assume true; {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {11279#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {11279#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11279#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:17,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {11279#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {11280#(<= main_~i~0 7)} assume true; {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,395 INFO L273 TraceCheckUtils]: 35: Hoare triple {11280#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,396 INFO L273 TraceCheckUtils]: 36: Hoare triple {11280#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11280#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:17,396 INFO L273 TraceCheckUtils]: 37: Hoare triple {11280#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,397 INFO L273 TraceCheckUtils]: 38: Hoare triple {11281#(<= main_~i~0 8)} assume true; {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {11281#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {11281#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11281#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:17,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {11281#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {11282#(<= main_~i~0 9)} assume true; {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {11282#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11282#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:17,401 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,401 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 10)} assume true; {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,402 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,402 INFO L273 TraceCheckUtils]: 48: Hoare triple {11283#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11283#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:17,403 INFO L273 TraceCheckUtils]: 49: Hoare triple {11283#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,404 INFO L273 TraceCheckUtils]: 50: Hoare triple {11284#(<= main_~i~0 11)} assume true; {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,404 INFO L273 TraceCheckUtils]: 51: Hoare triple {11284#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,405 INFO L273 TraceCheckUtils]: 52: Hoare triple {11284#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11284#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:17,405 INFO L273 TraceCheckUtils]: 53: Hoare triple {11284#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,406 INFO L273 TraceCheckUtils]: 54: Hoare triple {11285#(<= main_~i~0 12)} assume true; {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,406 INFO L273 TraceCheckUtils]: 55: Hoare triple {11285#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,407 INFO L273 TraceCheckUtils]: 56: Hoare triple {11285#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11285#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:17,407 INFO L273 TraceCheckUtils]: 57: Hoare triple {11285#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,408 INFO L273 TraceCheckUtils]: 58: Hoare triple {11286#(<= main_~i~0 13)} assume true; {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,408 INFO L273 TraceCheckUtils]: 59: Hoare triple {11286#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,409 INFO L273 TraceCheckUtils]: 60: Hoare triple {11286#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11286#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:17,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {11286#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,410 INFO L273 TraceCheckUtils]: 62: Hoare triple {11287#(<= main_~i~0 14)} assume true; {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,410 INFO L273 TraceCheckUtils]: 63: Hoare triple {11287#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,411 INFO L273 TraceCheckUtils]: 64: Hoare triple {11287#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11287#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:17,412 INFO L273 TraceCheckUtils]: 65: Hoare triple {11287#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,412 INFO L273 TraceCheckUtils]: 66: Hoare triple {11288#(<= main_~i~0 15)} assume true; {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {11288#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,413 INFO L273 TraceCheckUtils]: 68: Hoare triple {11288#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11288#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:17,414 INFO L273 TraceCheckUtils]: 69: Hoare triple {11288#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,414 INFO L273 TraceCheckUtils]: 70: Hoare triple {11289#(<= main_~i~0 16)} assume true; {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,415 INFO L273 TraceCheckUtils]: 71: Hoare triple {11289#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,415 INFO L273 TraceCheckUtils]: 72: Hoare triple {11289#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11289#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:17,416 INFO L273 TraceCheckUtils]: 73: Hoare triple {11289#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,417 INFO L273 TraceCheckUtils]: 74: Hoare triple {11290#(<= main_~i~0 17)} assume true; {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,417 INFO L273 TraceCheckUtils]: 75: Hoare triple {11290#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,418 INFO L273 TraceCheckUtils]: 76: Hoare triple {11290#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11290#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:17,418 INFO L273 TraceCheckUtils]: 77: Hoare triple {11290#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,419 INFO L273 TraceCheckUtils]: 78: Hoare triple {11291#(<= main_~i~0 18)} assume true; {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,419 INFO L273 TraceCheckUtils]: 79: Hoare triple {11291#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,420 INFO L273 TraceCheckUtils]: 80: Hoare triple {11291#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11291#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:17,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {11291#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,421 INFO L273 TraceCheckUtils]: 82: Hoare triple {11292#(<= main_~i~0 19)} assume true; {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,422 INFO L273 TraceCheckUtils]: 83: Hoare triple {11292#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,422 INFO L273 TraceCheckUtils]: 84: Hoare triple {11292#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11292#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:17,423 INFO L273 TraceCheckUtils]: 85: Hoare triple {11292#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,423 INFO L273 TraceCheckUtils]: 86: Hoare triple {11293#(<= main_~i~0 20)} assume true; {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,424 INFO L273 TraceCheckUtils]: 87: Hoare triple {11293#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,424 INFO L273 TraceCheckUtils]: 88: Hoare triple {11293#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11293#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:17,425 INFO L273 TraceCheckUtils]: 89: Hoare triple {11293#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11294#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,425 INFO L273 TraceCheckUtils]: 90: Hoare triple {11294#(<= main_~i~0 21)} assume true; {11294#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:17,426 INFO L273 TraceCheckUtils]: 91: Hoare triple {11294#(<= main_~i~0 21)} assume !(~i~0 < 100000); {11272#false} is VALID [2018-11-18 22:57:17,426 INFO L273 TraceCheckUtils]: 92: Hoare triple {11272#false} havoc ~x~0;~x~0 := 0; {11272#false} is VALID [2018-11-18 22:57:17,427 INFO L273 TraceCheckUtils]: 93: Hoare triple {11272#false} assume true; {11272#false} is VALID [2018-11-18 22:57:17,427 INFO L273 TraceCheckUtils]: 94: Hoare triple {11272#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {11272#false} is VALID [2018-11-18 22:57:17,427 INFO L256 TraceCheckUtils]: 95: Hoare triple {11272#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {11272#false} is VALID [2018-11-18 22:57:17,427 INFO L273 TraceCheckUtils]: 96: Hoare triple {11272#false} ~cond := #in~cond; {11272#false} is VALID [2018-11-18 22:57:17,427 INFO L273 TraceCheckUtils]: 97: Hoare triple {11272#false} assume 0 == ~cond; {11272#false} is VALID [2018-11-18 22:57:17,427 INFO L273 TraceCheckUtils]: 98: Hoare triple {11272#false} assume !false; {11272#false} is VALID [2018-11-18 22:57:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:17,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:17,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-18 22:57:17,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-18 22:57:17,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:17,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:57:17,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:17,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:57:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:57:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:57:17,552 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 25 states. [2018-11-18 22:57:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:18,388 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2018-11-18 22:57:18,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:57:18,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2018-11-18 22:57:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:57:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2018-11-18 22:57:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:57:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 163 transitions. [2018-11-18 22:57:18,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 163 transitions. [2018-11-18 22:57:18,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:18,557 INFO L225 Difference]: With dead ends: 134 [2018-11-18 22:57:18,557 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 22:57:18,558 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:57:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 22:57:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-11-18 22:57:18,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:18,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 114 states. [2018-11-18 22:57:18,593 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 114 states. [2018-11-18 22:57:18,593 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 114 states. [2018-11-18 22:57:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:18,595 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2018-11-18 22:57:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-11-18 22:57:18,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:18,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:18,596 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 116 states. [2018-11-18 22:57:18,597 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 116 states. [2018-11-18 22:57:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:18,599 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2018-11-18 22:57:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-11-18 22:57:18,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:18,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:18,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:18,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-18 22:57:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2018-11-18 22:57:18,602 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 99 [2018-11-18 22:57:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:18,603 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2018-11-18 22:57:18,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:57:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-18 22:57:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 22:57:18,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:18,604 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:18,605 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:18,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash -255692084, now seen corresponding path program 22 times [2018-11-18 22:57:18,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:18,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:18,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:19,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {12141#true} call ULTIMATE.init(); {12141#true} is VALID [2018-11-18 22:57:19,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {12141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12141#true} is VALID [2018-11-18 22:57:19,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {12141#true} assume true; {12141#true} is VALID [2018-11-18 22:57:19,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12141#true} {12141#true} #73#return; {12141#true} is VALID [2018-11-18 22:57:19,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {12141#true} call #t~ret7 := main(); {12141#true} is VALID [2018-11-18 22:57:19,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {12141#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {12143#(= main_~i~0 0)} is VALID [2018-11-18 22:57:19,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {12143#(= main_~i~0 0)} assume true; {12143#(= main_~i~0 0)} is VALID [2018-11-18 22:57:19,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {12143#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12143#(= main_~i~0 0)} is VALID [2018-11-18 22:57:19,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {12143#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12143#(= main_~i~0 0)} is VALID [2018-11-18 22:57:19,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {12143#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {12144#(<= main_~i~0 1)} assume true; {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,266 INFO L273 TraceCheckUtils]: 11: Hoare triple {12144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {12144#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {12144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {12145#(<= main_~i~0 2)} assume true; {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {12145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {12145#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {12145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {12146#(<= main_~i~0 3)} assume true; {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {12146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {12146#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {12146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {12147#(<= main_~i~0 4)} assume true; {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {12147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {12147#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {12147#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {12148#(<= main_~i~0 5)} assume true; {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {12148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {12148#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {12148#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {12149#(<= main_~i~0 6)} assume true; {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {12149#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {12149#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {12149#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {12150#(<= main_~i~0 7)} assume true; {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {12150#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {12150#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {12150#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {12151#(<= main_~i~0 8)} assume true; {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {12151#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {12151#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,283 INFO L273 TraceCheckUtils]: 41: Hoare triple {12151#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {12152#(<= main_~i~0 9)} assume true; {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {12152#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,285 INFO L273 TraceCheckUtils]: 44: Hoare triple {12152#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {12152#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {12153#(<= main_~i~0 10)} assume true; {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,287 INFO L273 TraceCheckUtils]: 47: Hoare triple {12153#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {12153#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {12153#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {12154#(<= main_~i~0 11)} assume true; {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {12154#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {12154#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {12154#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:19,291 INFO L273 TraceCheckUtils]: 54: Hoare triple {12155#(<= main_~i~0 12)} assume true; {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:19,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {12155#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:19,292 INFO L273 TraceCheckUtils]: 56: Hoare triple {12155#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:19,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {12155#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:19,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {12156#(<= main_~i~0 13)} assume true; {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:19,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {12156#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:19,294 INFO L273 TraceCheckUtils]: 60: Hoare triple {12156#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:19,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {12156#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:19,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {12157#(<= main_~i~0 14)} assume true; {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:19,296 INFO L273 TraceCheckUtils]: 63: Hoare triple {12157#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:19,296 INFO L273 TraceCheckUtils]: 64: Hoare triple {12157#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:19,297 INFO L273 TraceCheckUtils]: 65: Hoare triple {12157#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:19,297 INFO L273 TraceCheckUtils]: 66: Hoare triple {12158#(<= main_~i~0 15)} assume true; {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:19,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {12158#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:19,299 INFO L273 TraceCheckUtils]: 68: Hoare triple {12158#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:19,299 INFO L273 TraceCheckUtils]: 69: Hoare triple {12158#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:19,300 INFO L273 TraceCheckUtils]: 70: Hoare triple {12159#(<= main_~i~0 16)} assume true; {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:19,300 INFO L273 TraceCheckUtils]: 71: Hoare triple {12159#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:19,301 INFO L273 TraceCheckUtils]: 72: Hoare triple {12159#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:19,302 INFO L273 TraceCheckUtils]: 73: Hoare triple {12159#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:19,302 INFO L273 TraceCheckUtils]: 74: Hoare triple {12160#(<= main_~i~0 17)} assume true; {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:19,303 INFO L273 TraceCheckUtils]: 75: Hoare triple {12160#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:19,303 INFO L273 TraceCheckUtils]: 76: Hoare triple {12160#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:19,304 INFO L273 TraceCheckUtils]: 77: Hoare triple {12160#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:19,304 INFO L273 TraceCheckUtils]: 78: Hoare triple {12161#(<= main_~i~0 18)} assume true; {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:19,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {12161#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:19,305 INFO L273 TraceCheckUtils]: 80: Hoare triple {12161#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:19,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {12161#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:19,307 INFO L273 TraceCheckUtils]: 82: Hoare triple {12162#(<= main_~i~0 19)} assume true; {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:19,307 INFO L273 TraceCheckUtils]: 83: Hoare triple {12162#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:19,308 INFO L273 TraceCheckUtils]: 84: Hoare triple {12162#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:19,308 INFO L273 TraceCheckUtils]: 85: Hoare triple {12162#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:19,309 INFO L273 TraceCheckUtils]: 86: Hoare triple {12163#(<= main_~i~0 20)} assume true; {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:19,309 INFO L273 TraceCheckUtils]: 87: Hoare triple {12163#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:19,310 INFO L273 TraceCheckUtils]: 88: Hoare triple {12163#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:19,311 INFO L273 TraceCheckUtils]: 89: Hoare triple {12163#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:19,311 INFO L273 TraceCheckUtils]: 90: Hoare triple {12164#(<= main_~i~0 21)} assume true; {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:19,312 INFO L273 TraceCheckUtils]: 91: Hoare triple {12164#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:19,312 INFO L273 TraceCheckUtils]: 92: Hoare triple {12164#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:19,313 INFO L273 TraceCheckUtils]: 93: Hoare triple {12164#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12165#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:19,313 INFO L273 TraceCheckUtils]: 94: Hoare triple {12165#(<= main_~i~0 22)} assume true; {12165#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:19,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {12165#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12142#false} is VALID [2018-11-18 22:57:19,314 INFO L273 TraceCheckUtils]: 96: Hoare triple {12142#false} havoc ~x~0;~x~0 := 0; {12142#false} is VALID [2018-11-18 22:57:19,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {12142#false} assume true; {12142#false} is VALID [2018-11-18 22:57:19,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {12142#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {12142#false} is VALID [2018-11-18 22:57:19,315 INFO L256 TraceCheckUtils]: 99: Hoare triple {12142#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {12142#false} is VALID [2018-11-18 22:57:19,315 INFO L273 TraceCheckUtils]: 100: Hoare triple {12142#false} ~cond := #in~cond; {12142#false} is VALID [2018-11-18 22:57:19,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {12142#false} assume 0 == ~cond; {12142#false} is VALID [2018-11-18 22:57:19,316 INFO L273 TraceCheckUtils]: 102: Hoare triple {12142#false} assume !false; {12142#false} is VALID [2018-11-18 22:57:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:19,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:19,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:19,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:57:19,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:57:19,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:19,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:19,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {12141#true} call ULTIMATE.init(); {12141#true} is VALID [2018-11-18 22:57:19,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {12141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12141#true} is VALID [2018-11-18 22:57:19,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {12141#true} assume true; {12141#true} is VALID [2018-11-18 22:57:19,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12141#true} {12141#true} #73#return; {12141#true} is VALID [2018-11-18 22:57:19,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {12141#true} call #t~ret7 := main(); {12141#true} is VALID [2018-11-18 22:57:19,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {12141#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {12184#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:19,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {12184#(<= main_~i~0 0)} assume true; {12184#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:19,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {12184#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12184#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:19,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {12184#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12184#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:19,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {12184#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {12144#(<= main_~i~0 1)} assume true; {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {12144#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {12144#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12144#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:19,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {12144#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {12145#(<= main_~i~0 2)} assume true; {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {12145#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {12145#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12145#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:19,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {12145#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {12146#(<= main_~i~0 3)} assume true; {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {12146#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {12146#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12146#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:19,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {12146#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {12147#(<= main_~i~0 4)} assume true; {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {12147#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {12147#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12147#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:19,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {12147#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {12148#(<= main_~i~0 5)} assume true; {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {12148#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {12148#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12148#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:19,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {12148#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {12149#(<= main_~i~0 6)} assume true; {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {12149#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {12149#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12149#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:19,978 INFO L273 TraceCheckUtils]: 33: Hoare triple {12149#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {12150#(<= main_~i~0 7)} assume true; {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {12150#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {12150#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12150#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:19,979 INFO L273 TraceCheckUtils]: 37: Hoare triple {12150#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,980 INFO L273 TraceCheckUtils]: 38: Hoare triple {12151#(<= main_~i~0 8)} assume true; {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {12151#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {12151#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12151#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:19,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {12151#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {12152#(<= main_~i~0 9)} assume true; {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {12152#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {12152#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12152#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:19,984 INFO L273 TraceCheckUtils]: 45: Hoare triple {12152#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {12153#(<= main_~i~0 10)} assume true; {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,985 INFO L273 TraceCheckUtils]: 47: Hoare triple {12153#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,985 INFO L273 TraceCheckUtils]: 48: Hoare triple {12153#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12153#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:19,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {12153#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {12154#(<= main_~i~0 11)} assume true; {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {12154#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {12154#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12154#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:19,988 INFO L273 TraceCheckUtils]: 53: Hoare triple {12154#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:19,989 INFO L273 TraceCheckUtils]: 54: Hoare triple {12155#(<= main_~i~0 12)} assume true; {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:19,989 INFO L273 TraceCheckUtils]: 55: Hoare triple {12155#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,008 INFO L273 TraceCheckUtils]: 56: Hoare triple {12155#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12155#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:20,017 INFO L273 TraceCheckUtils]: 57: Hoare triple {12155#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,017 INFO L273 TraceCheckUtils]: 58: Hoare triple {12156#(<= main_~i~0 13)} assume true; {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {12156#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,018 INFO L273 TraceCheckUtils]: 60: Hoare triple {12156#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12156#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:20,018 INFO L273 TraceCheckUtils]: 61: Hoare triple {12156#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,018 INFO L273 TraceCheckUtils]: 62: Hoare triple {12157#(<= main_~i~0 14)} assume true; {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {12157#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,019 INFO L273 TraceCheckUtils]: 64: Hoare triple {12157#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12157#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:20,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {12157#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,020 INFO L273 TraceCheckUtils]: 66: Hoare triple {12158#(<= main_~i~0 15)} assume true; {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,020 INFO L273 TraceCheckUtils]: 67: Hoare triple {12158#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,021 INFO L273 TraceCheckUtils]: 68: Hoare triple {12158#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12158#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:20,021 INFO L273 TraceCheckUtils]: 69: Hoare triple {12158#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,021 INFO L273 TraceCheckUtils]: 70: Hoare triple {12159#(<= main_~i~0 16)} assume true; {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,022 INFO L273 TraceCheckUtils]: 71: Hoare triple {12159#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,022 INFO L273 TraceCheckUtils]: 72: Hoare triple {12159#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12159#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:20,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {12159#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,023 INFO L273 TraceCheckUtils]: 74: Hoare triple {12160#(<= main_~i~0 17)} assume true; {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,024 INFO L273 TraceCheckUtils]: 75: Hoare triple {12160#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,024 INFO L273 TraceCheckUtils]: 76: Hoare triple {12160#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12160#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:20,025 INFO L273 TraceCheckUtils]: 77: Hoare triple {12160#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,028 INFO L273 TraceCheckUtils]: 78: Hoare triple {12161#(<= main_~i~0 18)} assume true; {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,028 INFO L273 TraceCheckUtils]: 79: Hoare triple {12161#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,029 INFO L273 TraceCheckUtils]: 80: Hoare triple {12161#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12161#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:20,029 INFO L273 TraceCheckUtils]: 81: Hoare triple {12161#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,030 INFO L273 TraceCheckUtils]: 82: Hoare triple {12162#(<= main_~i~0 19)} assume true; {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,030 INFO L273 TraceCheckUtils]: 83: Hoare triple {12162#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,030 INFO L273 TraceCheckUtils]: 84: Hoare triple {12162#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12162#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:20,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {12162#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,031 INFO L273 TraceCheckUtils]: 86: Hoare triple {12163#(<= main_~i~0 20)} assume true; {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,032 INFO L273 TraceCheckUtils]: 87: Hoare triple {12163#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,032 INFO L273 TraceCheckUtils]: 88: Hoare triple {12163#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12163#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:20,033 INFO L273 TraceCheckUtils]: 89: Hoare triple {12163#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,033 INFO L273 TraceCheckUtils]: 90: Hoare triple {12164#(<= main_~i~0 21)} assume true; {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,034 INFO L273 TraceCheckUtils]: 91: Hoare triple {12164#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,034 INFO L273 TraceCheckUtils]: 92: Hoare triple {12164#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12164#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:20,035 INFO L273 TraceCheckUtils]: 93: Hoare triple {12164#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12165#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,035 INFO L273 TraceCheckUtils]: 94: Hoare triple {12165#(<= main_~i~0 22)} assume true; {12165#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:20,036 INFO L273 TraceCheckUtils]: 95: Hoare triple {12165#(<= main_~i~0 22)} assume !(~i~0 < 100000); {12142#false} is VALID [2018-11-18 22:57:20,036 INFO L273 TraceCheckUtils]: 96: Hoare triple {12142#false} havoc ~x~0;~x~0 := 0; {12142#false} is VALID [2018-11-18 22:57:20,036 INFO L273 TraceCheckUtils]: 97: Hoare triple {12142#false} assume true; {12142#false} is VALID [2018-11-18 22:57:20,037 INFO L273 TraceCheckUtils]: 98: Hoare triple {12142#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {12142#false} is VALID [2018-11-18 22:57:20,037 INFO L256 TraceCheckUtils]: 99: Hoare triple {12142#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {12142#false} is VALID [2018-11-18 22:57:20,037 INFO L273 TraceCheckUtils]: 100: Hoare triple {12142#false} ~cond := #in~cond; {12142#false} is VALID [2018-11-18 22:57:20,037 INFO L273 TraceCheckUtils]: 101: Hoare triple {12142#false} assume 0 == ~cond; {12142#false} is VALID [2018-11-18 22:57:20,037 INFO L273 TraceCheckUtils]: 102: Hoare triple {12142#false} assume !false; {12142#false} is VALID [2018-11-18 22:57:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:20,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:20,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-18 22:57:20,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-18 22:57:20,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:20,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:57:20,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:20,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:57:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:57:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:57:20,175 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand 26 states. [2018-11-18 22:57:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:20,737 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2018-11-18 22:57:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:57:20,737 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-18 22:57:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:57:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 168 transitions. [2018-11-18 22:57:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:57:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 168 transitions. [2018-11-18 22:57:20,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 168 transitions. [2018-11-18 22:57:20,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:20,891 INFO L225 Difference]: With dead ends: 138 [2018-11-18 22:57:20,892 INFO L226 Difference]: Without dead ends: 120 [2018-11-18 22:57:20,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:57:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-18 22:57:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-18 22:57:20,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:20,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 118 states. [2018-11-18 22:57:20,932 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 118 states. [2018-11-18 22:57:20,932 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 118 states. [2018-11-18 22:57:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:20,935 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2018-11-18 22:57:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2018-11-18 22:57:20,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:20,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:20,935 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 120 states. [2018-11-18 22:57:20,936 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 120 states. [2018-11-18 22:57:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:20,937 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2018-11-18 22:57:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2018-11-18 22:57:20,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:20,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:20,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:20,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-18 22:57:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2018-11-18 22:57:20,940 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 103 [2018-11-18 22:57:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:20,941 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2018-11-18 22:57:20,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:57:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2018-11-18 22:57:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 22:57:20,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:20,942 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:20,942 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:20,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1229791261, now seen corresponding path program 23 times [2018-11-18 22:57:20,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:20,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:20,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:20,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:20,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:21,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {13042#true} call ULTIMATE.init(); {13042#true} is VALID [2018-11-18 22:57:21,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {13042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13042#true} is VALID [2018-11-18 22:57:21,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {13042#true} assume true; {13042#true} is VALID [2018-11-18 22:57:21,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13042#true} {13042#true} #73#return; {13042#true} is VALID [2018-11-18 22:57:21,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {13042#true} call #t~ret7 := main(); {13042#true} is VALID [2018-11-18 22:57:21,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {13042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13044#(= main_~i~0 0)} is VALID [2018-11-18 22:57:21,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {13044#(= main_~i~0 0)} assume true; {13044#(= main_~i~0 0)} is VALID [2018-11-18 22:57:21,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {13044#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13044#(= main_~i~0 0)} is VALID [2018-11-18 22:57:21,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {13044#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13044#(= main_~i~0 0)} is VALID [2018-11-18 22:57:21,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {13044#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:21,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {13045#(<= main_~i~0 1)} assume true; {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:21,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {13045#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:21,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {13045#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:21,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {13045#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:21,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {13046#(<= main_~i~0 2)} assume true; {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:21,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {13046#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:21,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {13046#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:21,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {13046#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:21,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {13047#(<= main_~i~0 3)} assume true; {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:21,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {13047#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:21,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {13047#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:21,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {13047#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:21,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {13048#(<= main_~i~0 4)} assume true; {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:21,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {13048#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:21,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {13048#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:21,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {13048#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:21,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {13049#(<= main_~i~0 5)} assume true; {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:21,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {13049#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:21,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {13049#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:21,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {13049#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:21,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {13050#(<= main_~i~0 6)} assume true; {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:21,612 INFO L273 TraceCheckUtils]: 31: Hoare triple {13050#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:21,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {13050#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:21,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {13050#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:21,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {13051#(<= main_~i~0 7)} assume true; {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:21,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {13051#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:21,615 INFO L273 TraceCheckUtils]: 36: Hoare triple {13051#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:21,615 INFO L273 TraceCheckUtils]: 37: Hoare triple {13051#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:21,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {13052#(<= main_~i~0 8)} assume true; {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:21,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {13052#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:21,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {13052#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:21,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {13052#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:21,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {13053#(<= main_~i~0 9)} assume true; {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:21,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {13053#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:21,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {13053#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:21,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {13053#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:21,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {13054#(<= main_~i~0 10)} assume true; {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:21,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {13054#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:21,622 INFO L273 TraceCheckUtils]: 48: Hoare triple {13054#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:21,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {13054#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:21,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {13055#(<= main_~i~0 11)} assume true; {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:21,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {13055#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:21,624 INFO L273 TraceCheckUtils]: 52: Hoare triple {13055#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:21,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {13055#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:21,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {13056#(<= main_~i~0 12)} assume true; {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:21,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {13056#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:21,626 INFO L273 TraceCheckUtils]: 56: Hoare triple {13056#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:21,627 INFO L273 TraceCheckUtils]: 57: Hoare triple {13056#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:21,627 INFO L273 TraceCheckUtils]: 58: Hoare triple {13057#(<= main_~i~0 13)} assume true; {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:21,628 INFO L273 TraceCheckUtils]: 59: Hoare triple {13057#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:21,628 INFO L273 TraceCheckUtils]: 60: Hoare triple {13057#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:21,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {13057#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:21,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {13058#(<= main_~i~0 14)} assume true; {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:21,630 INFO L273 TraceCheckUtils]: 63: Hoare triple {13058#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:21,630 INFO L273 TraceCheckUtils]: 64: Hoare triple {13058#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:21,631 INFO L273 TraceCheckUtils]: 65: Hoare triple {13058#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:21,632 INFO L273 TraceCheckUtils]: 66: Hoare triple {13059#(<= main_~i~0 15)} assume true; {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:21,632 INFO L273 TraceCheckUtils]: 67: Hoare triple {13059#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:21,633 INFO L273 TraceCheckUtils]: 68: Hoare triple {13059#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:21,634 INFO L273 TraceCheckUtils]: 69: Hoare triple {13059#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:21,634 INFO L273 TraceCheckUtils]: 70: Hoare triple {13060#(<= main_~i~0 16)} assume true; {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:21,635 INFO L273 TraceCheckUtils]: 71: Hoare triple {13060#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:21,635 INFO L273 TraceCheckUtils]: 72: Hoare triple {13060#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:21,636 INFO L273 TraceCheckUtils]: 73: Hoare triple {13060#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:21,636 INFO L273 TraceCheckUtils]: 74: Hoare triple {13061#(<= main_~i~0 17)} assume true; {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:21,637 INFO L273 TraceCheckUtils]: 75: Hoare triple {13061#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:21,637 INFO L273 TraceCheckUtils]: 76: Hoare triple {13061#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:21,638 INFO L273 TraceCheckUtils]: 77: Hoare triple {13061#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:21,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {13062#(<= main_~i~0 18)} assume true; {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:21,639 INFO L273 TraceCheckUtils]: 79: Hoare triple {13062#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:21,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {13062#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:21,640 INFO L273 TraceCheckUtils]: 81: Hoare triple {13062#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:21,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {13063#(<= main_~i~0 19)} assume true; {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:21,641 INFO L273 TraceCheckUtils]: 83: Hoare triple {13063#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:21,642 INFO L273 TraceCheckUtils]: 84: Hoare triple {13063#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:21,643 INFO L273 TraceCheckUtils]: 85: Hoare triple {13063#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:21,643 INFO L273 TraceCheckUtils]: 86: Hoare triple {13064#(<= main_~i~0 20)} assume true; {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:21,644 INFO L273 TraceCheckUtils]: 87: Hoare triple {13064#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:21,644 INFO L273 TraceCheckUtils]: 88: Hoare triple {13064#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:21,645 INFO L273 TraceCheckUtils]: 89: Hoare triple {13064#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:21,646 INFO L273 TraceCheckUtils]: 90: Hoare triple {13065#(<= main_~i~0 21)} assume true; {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:21,646 INFO L273 TraceCheckUtils]: 91: Hoare triple {13065#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:21,647 INFO L273 TraceCheckUtils]: 92: Hoare triple {13065#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:21,647 INFO L273 TraceCheckUtils]: 93: Hoare triple {13065#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:21,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {13066#(<= main_~i~0 22)} assume true; {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:21,648 INFO L273 TraceCheckUtils]: 95: Hoare triple {13066#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:21,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {13066#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:21,650 INFO L273 TraceCheckUtils]: 97: Hoare triple {13066#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13067#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:21,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {13067#(<= main_~i~0 23)} assume true; {13067#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:21,651 INFO L273 TraceCheckUtils]: 99: Hoare triple {13067#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13043#false} is VALID [2018-11-18 22:57:21,651 INFO L273 TraceCheckUtils]: 100: Hoare triple {13043#false} havoc ~x~0;~x~0 := 0; {13043#false} is VALID [2018-11-18 22:57:21,651 INFO L273 TraceCheckUtils]: 101: Hoare triple {13043#false} assume true; {13043#false} is VALID [2018-11-18 22:57:21,652 INFO L273 TraceCheckUtils]: 102: Hoare triple {13043#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13043#false} is VALID [2018-11-18 22:57:21,652 INFO L256 TraceCheckUtils]: 103: Hoare triple {13043#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13043#false} is VALID [2018-11-18 22:57:21,652 INFO L273 TraceCheckUtils]: 104: Hoare triple {13043#false} ~cond := #in~cond; {13043#false} is VALID [2018-11-18 22:57:21,652 INFO L273 TraceCheckUtils]: 105: Hoare triple {13043#false} assume 0 == ~cond; {13043#false} is VALID [2018-11-18 22:57:21,652 INFO L273 TraceCheckUtils]: 106: Hoare triple {13043#false} assume !false; {13043#false} is VALID [2018-11-18 22:57:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:21,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:21,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:57:23,216 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-18 22:57:23,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:23,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:23,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {13042#true} call ULTIMATE.init(); {13042#true} is VALID [2018-11-18 22:57:23,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {13042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13042#true} is VALID [2018-11-18 22:57:23,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {13042#true} assume true; {13042#true} is VALID [2018-11-18 22:57:23,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13042#true} {13042#true} #73#return; {13042#true} is VALID [2018-11-18 22:57:23,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {13042#true} call #t~ret7 := main(); {13042#true} is VALID [2018-11-18 22:57:23,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {13042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13086#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(<= main_~i~0 0)} assume true; {13086#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {13086#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13086#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {13086#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13086#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:23,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {13086#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {13045#(<= main_~i~0 1)} assume true; {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {13045#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {13045#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13045#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:23,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {13045#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {13046#(<= main_~i~0 2)} assume true; {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {13046#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {13046#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13046#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:23,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {13046#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {13047#(<= main_~i~0 3)} assume true; {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {13047#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {13047#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13047#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:23,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {13047#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {13048#(<= main_~i~0 4)} assume true; {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {13048#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {13048#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13048#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:23,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {13048#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {13049#(<= main_~i~0 5)} assume true; {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {13049#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {13049#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13049#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:23,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {13049#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {13050#(<= main_~i~0 6)} assume true; {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,467 INFO L273 TraceCheckUtils]: 31: Hoare triple {13050#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {13050#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13050#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:23,469 INFO L273 TraceCheckUtils]: 33: Hoare triple {13050#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {13051#(<= main_~i~0 7)} assume true; {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {13051#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {13051#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13051#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:23,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {13051#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {13052#(<= main_~i~0 8)} assume true; {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {13052#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {13052#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13052#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:23,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {13052#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {13053#(<= main_~i~0 9)} assume true; {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {13053#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {13053#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13053#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:23,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {13053#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {13054#(<= main_~i~0 10)} assume true; {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {13054#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,476 INFO L273 TraceCheckUtils]: 48: Hoare triple {13054#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13054#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:23,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {13054#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,478 INFO L273 TraceCheckUtils]: 50: Hoare triple {13055#(<= main_~i~0 11)} assume true; {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {13055#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {13055#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13055#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:23,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {13055#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,480 INFO L273 TraceCheckUtils]: 54: Hoare triple {13056#(<= main_~i~0 12)} assume true; {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {13056#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,481 INFO L273 TraceCheckUtils]: 56: Hoare triple {13056#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13056#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:23,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {13056#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {13057#(<= main_~i~0 13)} assume true; {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,483 INFO L273 TraceCheckUtils]: 59: Hoare triple {13057#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,483 INFO L273 TraceCheckUtils]: 60: Hoare triple {13057#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13057#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:23,484 INFO L273 TraceCheckUtils]: 61: Hoare triple {13057#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,485 INFO L273 TraceCheckUtils]: 62: Hoare triple {13058#(<= main_~i~0 14)} assume true; {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,485 INFO L273 TraceCheckUtils]: 63: Hoare triple {13058#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,486 INFO L273 TraceCheckUtils]: 64: Hoare triple {13058#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13058#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:23,486 INFO L273 TraceCheckUtils]: 65: Hoare triple {13058#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,487 INFO L273 TraceCheckUtils]: 66: Hoare triple {13059#(<= main_~i~0 15)} assume true; {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,487 INFO L273 TraceCheckUtils]: 67: Hoare triple {13059#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,488 INFO L273 TraceCheckUtils]: 68: Hoare triple {13059#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13059#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:23,489 INFO L273 TraceCheckUtils]: 69: Hoare triple {13059#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,489 INFO L273 TraceCheckUtils]: 70: Hoare triple {13060#(<= main_~i~0 16)} assume true; {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {13060#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {13060#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13060#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:23,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {13060#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {13061#(<= main_~i~0 17)} assume true; {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,492 INFO L273 TraceCheckUtils]: 75: Hoare triple {13061#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,492 INFO L273 TraceCheckUtils]: 76: Hoare triple {13061#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13061#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:23,493 INFO L273 TraceCheckUtils]: 77: Hoare triple {13061#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,494 INFO L273 TraceCheckUtils]: 78: Hoare triple {13062#(<= main_~i~0 18)} assume true; {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,494 INFO L273 TraceCheckUtils]: 79: Hoare triple {13062#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,495 INFO L273 TraceCheckUtils]: 80: Hoare triple {13062#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13062#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:23,495 INFO L273 TraceCheckUtils]: 81: Hoare triple {13062#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,496 INFO L273 TraceCheckUtils]: 82: Hoare triple {13063#(<= main_~i~0 19)} assume true; {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,496 INFO L273 TraceCheckUtils]: 83: Hoare triple {13063#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,497 INFO L273 TraceCheckUtils]: 84: Hoare triple {13063#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13063#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:23,498 INFO L273 TraceCheckUtils]: 85: Hoare triple {13063#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {13064#(<= main_~i~0 20)} assume true; {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,499 INFO L273 TraceCheckUtils]: 87: Hoare triple {13064#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,499 INFO L273 TraceCheckUtils]: 88: Hoare triple {13064#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13064#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:23,500 INFO L273 TraceCheckUtils]: 89: Hoare triple {13064#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,500 INFO L273 TraceCheckUtils]: 90: Hoare triple {13065#(<= main_~i~0 21)} assume true; {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,501 INFO L273 TraceCheckUtils]: 91: Hoare triple {13065#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,501 INFO L273 TraceCheckUtils]: 92: Hoare triple {13065#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13065#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:23,502 INFO L273 TraceCheckUtils]: 93: Hoare triple {13065#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,503 INFO L273 TraceCheckUtils]: 94: Hoare triple {13066#(<= main_~i~0 22)} assume true; {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,503 INFO L273 TraceCheckUtils]: 95: Hoare triple {13066#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,504 INFO L273 TraceCheckUtils]: 96: Hoare triple {13066#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13066#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:23,504 INFO L273 TraceCheckUtils]: 97: Hoare triple {13066#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13067#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:23,505 INFO L273 TraceCheckUtils]: 98: Hoare triple {13067#(<= main_~i~0 23)} assume true; {13067#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:23,506 INFO L273 TraceCheckUtils]: 99: Hoare triple {13067#(<= main_~i~0 23)} assume !(~i~0 < 100000); {13043#false} is VALID [2018-11-18 22:57:23,506 INFO L273 TraceCheckUtils]: 100: Hoare triple {13043#false} havoc ~x~0;~x~0 := 0; {13043#false} is VALID [2018-11-18 22:57:23,506 INFO L273 TraceCheckUtils]: 101: Hoare triple {13043#false} assume true; {13043#false} is VALID [2018-11-18 22:57:23,506 INFO L273 TraceCheckUtils]: 102: Hoare triple {13043#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13043#false} is VALID [2018-11-18 22:57:23,506 INFO L256 TraceCheckUtils]: 103: Hoare triple {13043#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13043#false} is VALID [2018-11-18 22:57:23,507 INFO L273 TraceCheckUtils]: 104: Hoare triple {13043#false} ~cond := #in~cond; {13043#false} is VALID [2018-11-18 22:57:23,507 INFO L273 TraceCheckUtils]: 105: Hoare triple {13043#false} assume 0 == ~cond; {13043#false} is VALID [2018-11-18 22:57:23,507 INFO L273 TraceCheckUtils]: 106: Hoare triple {13043#false} assume !false; {13043#false} is VALID [2018-11-18 22:57:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:23,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:23,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-18 22:57:23,536 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-18 22:57:23,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:23,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-18 22:57:24,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:24,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 22:57:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 22:57:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:57:24,119 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand 27 states. [2018-11-18 22:57:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:24,821 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-11-18 22:57:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 22:57:24,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-11-18 22:57:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:57:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2018-11-18 22:57:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 22:57:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2018-11-18 22:57:24,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 173 transitions. [2018-11-18 22:57:24,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:24,988 INFO L225 Difference]: With dead ends: 142 [2018-11-18 22:57:24,988 INFO L226 Difference]: Without dead ends: 124 [2018-11-18 22:57:24,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-18 22:57:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-18 22:57:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-18 22:57:25,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:25,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-18 22:57:25,008 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-18 22:57:25,008 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-18 22:57:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:25,010 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-11-18 22:57:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2018-11-18 22:57:25,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:25,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:25,011 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-18 22:57:25,011 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-18 22:57:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:25,013 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-11-18 22:57:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2018-11-18 22:57:25,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:25,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:25,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:25,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 22:57:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2018-11-18 22:57:25,016 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 107 [2018-11-18 22:57:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:25,016 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2018-11-18 22:57:25,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 22:57:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2018-11-18 22:57:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 22:57:25,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:25,017 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:25,017 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:25,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash 99150202, now seen corresponding path program 24 times [2018-11-18 22:57:25,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:25,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:25,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:26,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {13974#true} call ULTIMATE.init(); {13974#true} is VALID [2018-11-18 22:57:26,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {13974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13974#true} is VALID [2018-11-18 22:57:26,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {13974#true} assume true; {13974#true} is VALID [2018-11-18 22:57:26,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13974#true} {13974#true} #73#return; {13974#true} is VALID [2018-11-18 22:57:26,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {13974#true} call #t~ret7 := main(); {13974#true} is VALID [2018-11-18 22:57:26,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {13974#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13976#(= main_~i~0 0)} is VALID [2018-11-18 22:57:26,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {13976#(= main_~i~0 0)} assume true; {13976#(= main_~i~0 0)} is VALID [2018-11-18 22:57:26,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {13976#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13976#(= main_~i~0 0)} is VALID [2018-11-18 22:57:26,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {13976#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13976#(= main_~i~0 0)} is VALID [2018-11-18 22:57:26,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {13976#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {13977#(<= main_~i~0 1)} assume true; {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {13977#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,054 INFO L273 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:26,054 INFO L273 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 2)} assume true; {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,055 INFO L273 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {13978#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:26,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {13978#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {13979#(<= main_~i~0 3)} assume true; {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {13979#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:26,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 4)} assume true; {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {13980#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:26,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {13980#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {13981#(<= main_~i~0 5)} assume true; {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,062 INFO L273 TraceCheckUtils]: 27: Hoare triple {13981#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {13981#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:26,064 INFO L273 TraceCheckUtils]: 29: Hoare triple {13981#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {13982#(<= main_~i~0 6)} assume true; {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {13982#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {13982#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:26,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {13982#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,066 INFO L273 TraceCheckUtils]: 34: Hoare triple {13983#(<= main_~i~0 7)} assume true; {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {13983#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,067 INFO L273 TraceCheckUtils]: 36: Hoare triple {13983#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:26,068 INFO L273 TraceCheckUtils]: 37: Hoare triple {13983#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {13984#(<= main_~i~0 8)} assume true; {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {13984#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,070 INFO L273 TraceCheckUtils]: 40: Hoare triple {13984#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:26,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {13984#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {13985#(<= main_~i~0 9)} assume true; {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {13985#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,072 INFO L273 TraceCheckUtils]: 44: Hoare triple {13985#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:26,073 INFO L273 TraceCheckUtils]: 45: Hoare triple {13985#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {13986#(<= main_~i~0 10)} assume true; {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,074 INFO L273 TraceCheckUtils]: 47: Hoare triple {13986#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {13986#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:26,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {13986#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {13987#(<= main_~i~0 11)} assume true; {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {13987#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {13987#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:26,077 INFO L273 TraceCheckUtils]: 53: Hoare triple {13987#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {13988#(<= main_~i~0 12)} assume true; {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {13988#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {13988#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:26,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {13988#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {13989#(<= main_~i~0 13)} assume true; {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {13989#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,081 INFO L273 TraceCheckUtils]: 60: Hoare triple {13989#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:26,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {13989#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,082 INFO L273 TraceCheckUtils]: 62: Hoare triple {13990#(<= main_~i~0 14)} assume true; {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,083 INFO L273 TraceCheckUtils]: 63: Hoare triple {13990#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {13990#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:26,084 INFO L273 TraceCheckUtils]: 65: Hoare triple {13990#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,085 INFO L273 TraceCheckUtils]: 66: Hoare triple {13991#(<= main_~i~0 15)} assume true; {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,085 INFO L273 TraceCheckUtils]: 67: Hoare triple {13991#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,086 INFO L273 TraceCheckUtils]: 68: Hoare triple {13991#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:26,086 INFO L273 TraceCheckUtils]: 69: Hoare triple {13991#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,087 INFO L273 TraceCheckUtils]: 70: Hoare triple {13992#(<= main_~i~0 16)} assume true; {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,087 INFO L273 TraceCheckUtils]: 71: Hoare triple {13992#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,088 INFO L273 TraceCheckUtils]: 72: Hoare triple {13992#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:26,089 INFO L273 TraceCheckUtils]: 73: Hoare triple {13992#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,089 INFO L273 TraceCheckUtils]: 74: Hoare triple {13993#(<= main_~i~0 17)} assume true; {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,090 INFO L273 TraceCheckUtils]: 75: Hoare triple {13993#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,090 INFO L273 TraceCheckUtils]: 76: Hoare triple {13993#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:26,091 INFO L273 TraceCheckUtils]: 77: Hoare triple {13993#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,092 INFO L273 TraceCheckUtils]: 78: Hoare triple {13994#(<= main_~i~0 18)} assume true; {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,092 INFO L273 TraceCheckUtils]: 79: Hoare triple {13994#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,093 INFO L273 TraceCheckUtils]: 80: Hoare triple {13994#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:26,093 INFO L273 TraceCheckUtils]: 81: Hoare triple {13994#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,094 INFO L273 TraceCheckUtils]: 82: Hoare triple {13995#(<= main_~i~0 19)} assume true; {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,094 INFO L273 TraceCheckUtils]: 83: Hoare triple {13995#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,095 INFO L273 TraceCheckUtils]: 84: Hoare triple {13995#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:26,096 INFO L273 TraceCheckUtils]: 85: Hoare triple {13995#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,096 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#(<= main_~i~0 20)} assume true; {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,097 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,097 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:26,098 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,098 INFO L273 TraceCheckUtils]: 90: Hoare triple {13997#(<= main_~i~0 21)} assume true; {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,099 INFO L273 TraceCheckUtils]: 91: Hoare triple {13997#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,099 INFO L273 TraceCheckUtils]: 92: Hoare triple {13997#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:26,100 INFO L273 TraceCheckUtils]: 93: Hoare triple {13997#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,100 INFO L273 TraceCheckUtils]: 94: Hoare triple {13998#(<= main_~i~0 22)} assume true; {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,101 INFO L273 TraceCheckUtils]: 95: Hoare triple {13998#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,101 INFO L273 TraceCheckUtils]: 96: Hoare triple {13998#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:26,102 INFO L273 TraceCheckUtils]: 97: Hoare triple {13998#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,103 INFO L273 TraceCheckUtils]: 98: Hoare triple {13999#(<= main_~i~0 23)} assume true; {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,103 INFO L273 TraceCheckUtils]: 99: Hoare triple {13999#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,104 INFO L273 TraceCheckUtils]: 100: Hoare triple {13999#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:26,104 INFO L273 TraceCheckUtils]: 101: Hoare triple {13999#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14000#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:26,105 INFO L273 TraceCheckUtils]: 102: Hoare triple {14000#(<= main_~i~0 24)} assume true; {14000#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:26,105 INFO L273 TraceCheckUtils]: 103: Hoare triple {14000#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13975#false} is VALID [2018-11-18 22:57:26,106 INFO L273 TraceCheckUtils]: 104: Hoare triple {13975#false} havoc ~x~0;~x~0 := 0; {13975#false} is VALID [2018-11-18 22:57:26,106 INFO L273 TraceCheckUtils]: 105: Hoare triple {13975#false} assume true; {13975#false} is VALID [2018-11-18 22:57:26,106 INFO L273 TraceCheckUtils]: 106: Hoare triple {13975#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13975#false} is VALID [2018-11-18 22:57:26,106 INFO L256 TraceCheckUtils]: 107: Hoare triple {13975#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13975#false} is VALID [2018-11-18 22:57:26,106 INFO L273 TraceCheckUtils]: 108: Hoare triple {13975#false} ~cond := #in~cond; {13975#false} is VALID [2018-11-18 22:57:26,107 INFO L273 TraceCheckUtils]: 109: Hoare triple {13975#false} assume 0 == ~cond; {13975#false} is VALID [2018-11-18 22:57:26,107 INFO L273 TraceCheckUtils]: 110: Hoare triple {13975#false} assume !false; {13975#false} is VALID [2018-11-18 22:57:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:26,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:26,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:26,125 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:57:26,887 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-18 22:57:26,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:26,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:27,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {13974#true} call ULTIMATE.init(); {13974#true} is VALID [2018-11-18 22:57:27,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {13974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13974#true} is VALID [2018-11-18 22:57:27,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {13974#true} assume true; {13974#true} is VALID [2018-11-18 22:57:27,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13974#true} {13974#true} #73#return; {13974#true} is VALID [2018-11-18 22:57:27,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {13974#true} call #t~ret7 := main(); {13974#true} is VALID [2018-11-18 22:57:27,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {13974#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14019#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:27,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {14019#(<= main_~i~0 0)} assume true; {14019#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:27,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {14019#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14019#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:27,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {14019#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14019#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:27,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {14019#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:27,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {13977#(<= main_~i~0 1)} assume true; {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:27,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {13977#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:27,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {13977#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13977#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:27,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {13977#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:27,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {13978#(<= main_~i~0 2)} assume true; {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:27,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {13978#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:27,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {13978#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13978#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:27,116 INFO L273 TraceCheckUtils]: 17: Hoare triple {13978#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:27,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {13979#(<= main_~i~0 3)} assume true; {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:27,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {13979#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:27,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {13979#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13979#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:27,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {13979#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:27,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {13980#(<= main_~i~0 4)} assume true; {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:27,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {13980#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:27,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {13980#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13980#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:27,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {13980#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:27,121 INFO L273 TraceCheckUtils]: 26: Hoare triple {13981#(<= main_~i~0 5)} assume true; {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:27,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {13981#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:27,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {13981#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13981#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:27,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {13981#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:27,123 INFO L273 TraceCheckUtils]: 30: Hoare triple {13982#(<= main_~i~0 6)} assume true; {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:27,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {13982#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:27,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {13982#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13982#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:27,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {13982#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:27,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {13983#(<= main_~i~0 7)} assume true; {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:27,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {13983#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:27,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {13983#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13983#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:27,127 INFO L273 TraceCheckUtils]: 37: Hoare triple {13983#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:27,127 INFO L273 TraceCheckUtils]: 38: Hoare triple {13984#(<= main_~i~0 8)} assume true; {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:27,128 INFO L273 TraceCheckUtils]: 39: Hoare triple {13984#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:27,128 INFO L273 TraceCheckUtils]: 40: Hoare triple {13984#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13984#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:27,129 INFO L273 TraceCheckUtils]: 41: Hoare triple {13984#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:27,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {13985#(<= main_~i~0 9)} assume true; {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:27,130 INFO L273 TraceCheckUtils]: 43: Hoare triple {13985#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:27,130 INFO L273 TraceCheckUtils]: 44: Hoare triple {13985#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13985#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:27,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {13985#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:27,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {13986#(<= main_~i~0 10)} assume true; {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:27,132 INFO L273 TraceCheckUtils]: 47: Hoare triple {13986#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:27,132 INFO L273 TraceCheckUtils]: 48: Hoare triple {13986#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13986#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:27,133 INFO L273 TraceCheckUtils]: 49: Hoare triple {13986#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:27,134 INFO L273 TraceCheckUtils]: 50: Hoare triple {13987#(<= main_~i~0 11)} assume true; {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:27,134 INFO L273 TraceCheckUtils]: 51: Hoare triple {13987#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:27,134 INFO L273 TraceCheckUtils]: 52: Hoare triple {13987#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13987#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:27,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {13987#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:27,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {13988#(<= main_~i~0 12)} assume true; {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:27,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {13988#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:27,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {13988#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13988#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:27,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {13988#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:27,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {13989#(<= main_~i~0 13)} assume true; {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:27,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {13989#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:27,139 INFO L273 TraceCheckUtils]: 60: Hoare triple {13989#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13989#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:27,139 INFO L273 TraceCheckUtils]: 61: Hoare triple {13989#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:27,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {13990#(<= main_~i~0 14)} assume true; {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:27,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {13990#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:27,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {13990#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13990#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:27,142 INFO L273 TraceCheckUtils]: 65: Hoare triple {13990#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:27,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {13991#(<= main_~i~0 15)} assume true; {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:27,143 INFO L273 TraceCheckUtils]: 67: Hoare triple {13991#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:27,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {13991#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13991#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:27,144 INFO L273 TraceCheckUtils]: 69: Hoare triple {13991#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:27,144 INFO L273 TraceCheckUtils]: 70: Hoare triple {13992#(<= main_~i~0 16)} assume true; {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:27,145 INFO L273 TraceCheckUtils]: 71: Hoare triple {13992#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:27,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {13992#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13992#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:27,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {13992#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:27,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {13993#(<= main_~i~0 17)} assume true; {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:27,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {13993#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:27,147 INFO L273 TraceCheckUtils]: 76: Hoare triple {13993#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13993#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:27,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {13993#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:27,148 INFO L273 TraceCheckUtils]: 78: Hoare triple {13994#(<= main_~i~0 18)} assume true; {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:27,149 INFO L273 TraceCheckUtils]: 79: Hoare triple {13994#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:27,149 INFO L273 TraceCheckUtils]: 80: Hoare triple {13994#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13994#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:27,150 INFO L273 TraceCheckUtils]: 81: Hoare triple {13994#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:27,151 INFO L273 TraceCheckUtils]: 82: Hoare triple {13995#(<= main_~i~0 19)} assume true; {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:27,151 INFO L273 TraceCheckUtils]: 83: Hoare triple {13995#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:27,151 INFO L273 TraceCheckUtils]: 84: Hoare triple {13995#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13995#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:27,152 INFO L273 TraceCheckUtils]: 85: Hoare triple {13995#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:27,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#(<= main_~i~0 20)} assume true; {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:27,153 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:27,154 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13996#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:27,154 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:27,155 INFO L273 TraceCheckUtils]: 90: Hoare triple {13997#(<= main_~i~0 21)} assume true; {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:27,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {13997#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:27,156 INFO L273 TraceCheckUtils]: 92: Hoare triple {13997#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13997#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:27,156 INFO L273 TraceCheckUtils]: 93: Hoare triple {13997#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:27,157 INFO L273 TraceCheckUtils]: 94: Hoare triple {13998#(<= main_~i~0 22)} assume true; {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:27,157 INFO L273 TraceCheckUtils]: 95: Hoare triple {13998#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:27,158 INFO L273 TraceCheckUtils]: 96: Hoare triple {13998#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13998#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:27,159 INFO L273 TraceCheckUtils]: 97: Hoare triple {13998#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:27,159 INFO L273 TraceCheckUtils]: 98: Hoare triple {13999#(<= main_~i~0 23)} assume true; {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:27,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {13999#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:27,160 INFO L273 TraceCheckUtils]: 100: Hoare triple {13999#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13999#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:27,161 INFO L273 TraceCheckUtils]: 101: Hoare triple {13999#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14000#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:27,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {14000#(<= main_~i~0 24)} assume true; {14000#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:27,162 INFO L273 TraceCheckUtils]: 103: Hoare triple {14000#(<= main_~i~0 24)} assume !(~i~0 < 100000); {13975#false} is VALID [2018-11-18 22:57:27,162 INFO L273 TraceCheckUtils]: 104: Hoare triple {13975#false} havoc ~x~0;~x~0 := 0; {13975#false} is VALID [2018-11-18 22:57:27,162 INFO L273 TraceCheckUtils]: 105: Hoare triple {13975#false} assume true; {13975#false} is VALID [2018-11-18 22:57:27,162 INFO L273 TraceCheckUtils]: 106: Hoare triple {13975#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13975#false} is VALID [2018-11-18 22:57:27,163 INFO L256 TraceCheckUtils]: 107: Hoare triple {13975#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13975#false} is VALID [2018-11-18 22:57:27,163 INFO L273 TraceCheckUtils]: 108: Hoare triple {13975#false} ~cond := #in~cond; {13975#false} is VALID [2018-11-18 22:57:27,163 INFO L273 TraceCheckUtils]: 109: Hoare triple {13975#false} assume 0 == ~cond; {13975#false} is VALID [2018-11-18 22:57:27,163 INFO L273 TraceCheckUtils]: 110: Hoare triple {13975#false} assume !false; {13975#false} is VALID [2018-11-18 22:57:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:27,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:27,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-18 22:57:27,192 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-18 22:57:27,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:27,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 22:57:27,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:27,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 22:57:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 22:57:27,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:57:27,727 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand 28 states. [2018-11-18 22:57:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:28,499 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2018-11-18 22:57:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 22:57:28,500 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2018-11-18 22:57:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:57:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 178 transitions. [2018-11-18 22:57:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 22:57:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 178 transitions. [2018-11-18 22:57:28,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 178 transitions. [2018-11-18 22:57:28,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:28,793 INFO L225 Difference]: With dead ends: 146 [2018-11-18 22:57:28,793 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 22:57:28,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-18 22:57:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 22:57:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-18 22:57:28,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:28,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2018-11-18 22:57:28,870 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2018-11-18 22:57:28,870 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2018-11-18 22:57:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:28,872 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-11-18 22:57:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2018-11-18 22:57:28,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:28,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:28,873 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2018-11-18 22:57:28,873 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2018-11-18 22:57:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:28,875 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-11-18 22:57:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2018-11-18 22:57:28,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:28,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:28,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:28,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 22:57:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2018-11-18 22:57:28,878 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 111 [2018-11-18 22:57:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:28,879 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2018-11-18 22:57:28,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 22:57:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2018-11-18 22:57:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 22:57:28,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:28,880 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:28,881 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:28,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1363300241, now seen corresponding path program 25 times [2018-11-18 22:57:28,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:28,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:28,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:29,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {14937#true} call ULTIMATE.init(); {14937#true} is VALID [2018-11-18 22:57:29,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {14937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14937#true} is VALID [2018-11-18 22:57:29,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {14937#true} assume true; {14937#true} is VALID [2018-11-18 22:57:29,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14937#true} {14937#true} #73#return; {14937#true} is VALID [2018-11-18 22:57:29,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {14937#true} call #t~ret7 := main(); {14937#true} is VALID [2018-11-18 22:57:29,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {14937#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14939#(= main_~i~0 0)} is VALID [2018-11-18 22:57:29,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {14939#(= main_~i~0 0)} assume true; {14939#(= main_~i~0 0)} is VALID [2018-11-18 22:57:29,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {14939#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14939#(= main_~i~0 0)} is VALID [2018-11-18 22:57:29,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {14939#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14939#(= main_~i~0 0)} is VALID [2018-11-18 22:57:29,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {14939#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:29,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {14940#(<= main_~i~0 1)} assume true; {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:29,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {14940#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:29,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {14940#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:29,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {14940#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:29,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {14941#(<= main_~i~0 2)} assume true; {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:29,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {14941#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:29,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {14941#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:29,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {14941#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:29,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {14942#(<= main_~i~0 3)} assume true; {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:29,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {14942#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:29,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {14942#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:29,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {14942#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:29,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {14943#(<= main_~i~0 4)} assume true; {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:29,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {14943#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:29,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:29,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:29,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 5)} assume true; {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:29,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:29,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {14944#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:29,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {14944#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:29,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {14945#(<= main_~i~0 6)} assume true; {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:29,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {14945#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:29,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {14945#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:29,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {14945#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:29,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {14946#(<= main_~i~0 7)} assume true; {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:29,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {14946#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:29,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {14946#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:29,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {14946#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:29,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {14947#(<= main_~i~0 8)} assume true; {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:29,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {14947#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:29,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {14947#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:29,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {14947#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:29,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {14948#(<= main_~i~0 9)} assume true; {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:29,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {14948#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:29,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {14948#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:29,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {14948#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:29,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {14949#(<= main_~i~0 10)} assume true; {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:29,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {14949#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:29,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {14949#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:29,854 INFO L273 TraceCheckUtils]: 49: Hoare triple {14949#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:29,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {14950#(<= main_~i~0 11)} assume true; {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:29,856 INFO L273 TraceCheckUtils]: 51: Hoare triple {14950#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:29,857 INFO L273 TraceCheckUtils]: 52: Hoare triple {14950#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:29,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {14950#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:29,858 INFO L273 TraceCheckUtils]: 54: Hoare triple {14951#(<= main_~i~0 12)} assume true; {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:29,858 INFO L273 TraceCheckUtils]: 55: Hoare triple {14951#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:29,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {14951#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:29,859 INFO L273 TraceCheckUtils]: 57: Hoare triple {14951#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:29,859 INFO L273 TraceCheckUtils]: 58: Hoare triple {14952#(<= main_~i~0 13)} assume true; {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:29,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {14952#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:29,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {14952#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:29,860 INFO L273 TraceCheckUtils]: 61: Hoare triple {14952#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:29,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {14953#(<= main_~i~0 14)} assume true; {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:29,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {14953#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:29,862 INFO L273 TraceCheckUtils]: 64: Hoare triple {14953#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:29,862 INFO L273 TraceCheckUtils]: 65: Hoare triple {14953#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:29,863 INFO L273 TraceCheckUtils]: 66: Hoare triple {14954#(<= main_~i~0 15)} assume true; {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:29,863 INFO L273 TraceCheckUtils]: 67: Hoare triple {14954#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:29,864 INFO L273 TraceCheckUtils]: 68: Hoare triple {14954#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:29,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {14954#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:29,865 INFO L273 TraceCheckUtils]: 70: Hoare triple {14955#(<= main_~i~0 16)} assume true; {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:29,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {14955#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:29,866 INFO L273 TraceCheckUtils]: 72: Hoare triple {14955#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:29,867 INFO L273 TraceCheckUtils]: 73: Hoare triple {14955#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:29,867 INFO L273 TraceCheckUtils]: 74: Hoare triple {14956#(<= main_~i~0 17)} assume true; {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:29,868 INFO L273 TraceCheckUtils]: 75: Hoare triple {14956#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:29,868 INFO L273 TraceCheckUtils]: 76: Hoare triple {14956#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:29,869 INFO L273 TraceCheckUtils]: 77: Hoare triple {14956#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:29,869 INFO L273 TraceCheckUtils]: 78: Hoare triple {14957#(<= main_~i~0 18)} assume true; {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:29,870 INFO L273 TraceCheckUtils]: 79: Hoare triple {14957#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:29,870 INFO L273 TraceCheckUtils]: 80: Hoare triple {14957#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:29,871 INFO L273 TraceCheckUtils]: 81: Hoare triple {14957#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:29,871 INFO L273 TraceCheckUtils]: 82: Hoare triple {14958#(<= main_~i~0 19)} assume true; {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:29,872 INFO L273 TraceCheckUtils]: 83: Hoare triple {14958#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:29,872 INFO L273 TraceCheckUtils]: 84: Hoare triple {14958#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:29,873 INFO L273 TraceCheckUtils]: 85: Hoare triple {14958#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:29,874 INFO L273 TraceCheckUtils]: 86: Hoare triple {14959#(<= main_~i~0 20)} assume true; {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:29,875 INFO L273 TraceCheckUtils]: 87: Hoare triple {14959#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:29,875 INFO L273 TraceCheckUtils]: 88: Hoare triple {14959#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:29,876 INFO L273 TraceCheckUtils]: 89: Hoare triple {14959#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:29,877 INFO L273 TraceCheckUtils]: 90: Hoare triple {14960#(<= main_~i~0 21)} assume true; {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:29,877 INFO L273 TraceCheckUtils]: 91: Hoare triple {14960#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:29,877 INFO L273 TraceCheckUtils]: 92: Hoare triple {14960#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:29,878 INFO L273 TraceCheckUtils]: 93: Hoare triple {14960#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:29,878 INFO L273 TraceCheckUtils]: 94: Hoare triple {14961#(<= main_~i~0 22)} assume true; {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:29,878 INFO L273 TraceCheckUtils]: 95: Hoare triple {14961#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:29,879 INFO L273 TraceCheckUtils]: 96: Hoare triple {14961#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:29,879 INFO L273 TraceCheckUtils]: 97: Hoare triple {14961#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:29,880 INFO L273 TraceCheckUtils]: 98: Hoare triple {14962#(<= main_~i~0 23)} assume true; {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:29,880 INFO L273 TraceCheckUtils]: 99: Hoare triple {14962#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:29,881 INFO L273 TraceCheckUtils]: 100: Hoare triple {14962#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:29,881 INFO L273 TraceCheckUtils]: 101: Hoare triple {14962#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:29,882 INFO L273 TraceCheckUtils]: 102: Hoare triple {14963#(<= main_~i~0 24)} assume true; {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:29,882 INFO L273 TraceCheckUtils]: 103: Hoare triple {14963#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:29,883 INFO L273 TraceCheckUtils]: 104: Hoare triple {14963#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:29,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {14963#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14964#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:29,884 INFO L273 TraceCheckUtils]: 106: Hoare triple {14964#(<= main_~i~0 25)} assume true; {14964#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:29,885 INFO L273 TraceCheckUtils]: 107: Hoare triple {14964#(<= main_~i~0 25)} assume !(~i~0 < 100000); {14938#false} is VALID [2018-11-18 22:57:29,885 INFO L273 TraceCheckUtils]: 108: Hoare triple {14938#false} havoc ~x~0;~x~0 := 0; {14938#false} is VALID [2018-11-18 22:57:29,885 INFO L273 TraceCheckUtils]: 109: Hoare triple {14938#false} assume true; {14938#false} is VALID [2018-11-18 22:57:29,885 INFO L273 TraceCheckUtils]: 110: Hoare triple {14938#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {14938#false} is VALID [2018-11-18 22:57:29,886 INFO L256 TraceCheckUtils]: 111: Hoare triple {14938#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {14938#false} is VALID [2018-11-18 22:57:29,886 INFO L273 TraceCheckUtils]: 112: Hoare triple {14938#false} ~cond := #in~cond; {14938#false} is VALID [2018-11-18 22:57:29,886 INFO L273 TraceCheckUtils]: 113: Hoare triple {14938#false} assume 0 == ~cond; {14938#false} is VALID [2018-11-18 22:57:29,886 INFO L273 TraceCheckUtils]: 114: Hoare triple {14938#false} assume !false; {14938#false} is VALID [2018-11-18 22:57:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:29,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:29,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:29,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:30,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {14937#true} call ULTIMATE.init(); {14937#true} is VALID [2018-11-18 22:57:30,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {14937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14937#true} is VALID [2018-11-18 22:57:30,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {14937#true} assume true; {14937#true} is VALID [2018-11-18 22:57:30,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14937#true} {14937#true} #73#return; {14937#true} is VALID [2018-11-18 22:57:30,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {14937#true} call #t~ret7 := main(); {14937#true} is VALID [2018-11-18 22:57:30,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {14937#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14983#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:30,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {14983#(<= main_~i~0 0)} assume true; {14983#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:30,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {14983#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14983#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:30,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {14983#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14983#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:30,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {14983#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:30,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {14940#(<= main_~i~0 1)} assume true; {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:30,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {14940#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:30,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {14940#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14940#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:30,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {14940#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:30,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {14941#(<= main_~i~0 2)} assume true; {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:30,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {14941#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:30,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {14941#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14941#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:30,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {14941#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:30,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {14942#(<= main_~i~0 3)} assume true; {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:30,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {14942#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:30,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {14942#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14942#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:30,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {14942#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:30,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {14943#(<= main_~i~0 4)} assume true; {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:30,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {14943#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:30,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14943#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:30,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:30,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 5)} assume true; {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:30,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:30,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {14944#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14944#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:30,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {14944#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:30,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {14945#(<= main_~i~0 6)} assume true; {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:30,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {14945#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:30,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {14945#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14945#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:30,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {14945#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:30,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {14946#(<= main_~i~0 7)} assume true; {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:30,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {14946#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:30,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {14946#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14946#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:30,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {14946#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:30,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {14947#(<= main_~i~0 8)} assume true; {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:30,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {14947#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:30,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {14947#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14947#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:30,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {14947#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:30,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {14948#(<= main_~i~0 9)} assume true; {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:30,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {14948#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:30,536 INFO L273 TraceCheckUtils]: 44: Hoare triple {14948#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14948#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:30,536 INFO L273 TraceCheckUtils]: 45: Hoare triple {14948#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:30,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {14949#(<= main_~i~0 10)} assume true; {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:30,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {14949#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:30,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {14949#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14949#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:30,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {14949#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:30,539 INFO L273 TraceCheckUtils]: 50: Hoare triple {14950#(<= main_~i~0 11)} assume true; {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:30,539 INFO L273 TraceCheckUtils]: 51: Hoare triple {14950#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:30,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {14950#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14950#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:30,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {14950#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:30,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {14951#(<= main_~i~0 12)} assume true; {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:30,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {14951#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:30,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {14951#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14951#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:30,568 INFO L273 TraceCheckUtils]: 57: Hoare triple {14951#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:30,572 INFO L273 TraceCheckUtils]: 58: Hoare triple {14952#(<= main_~i~0 13)} assume true; {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:30,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {14952#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:30,574 INFO L273 TraceCheckUtils]: 60: Hoare triple {14952#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14952#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:30,574 INFO L273 TraceCheckUtils]: 61: Hoare triple {14952#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:30,576 INFO L273 TraceCheckUtils]: 62: Hoare triple {14953#(<= main_~i~0 14)} assume true; {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:30,576 INFO L273 TraceCheckUtils]: 63: Hoare triple {14953#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:30,576 INFO L273 TraceCheckUtils]: 64: Hoare triple {14953#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14953#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:30,577 INFO L273 TraceCheckUtils]: 65: Hoare triple {14953#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:30,577 INFO L273 TraceCheckUtils]: 66: Hoare triple {14954#(<= main_~i~0 15)} assume true; {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:30,577 INFO L273 TraceCheckUtils]: 67: Hoare triple {14954#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:30,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {14954#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14954#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:30,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {14954#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:30,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {14955#(<= main_~i~0 16)} assume true; {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:30,579 INFO L273 TraceCheckUtils]: 71: Hoare triple {14955#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:30,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {14955#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14955#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:30,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {14955#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:30,580 INFO L273 TraceCheckUtils]: 74: Hoare triple {14956#(<= main_~i~0 17)} assume true; {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:30,580 INFO L273 TraceCheckUtils]: 75: Hoare triple {14956#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:30,580 INFO L273 TraceCheckUtils]: 76: Hoare triple {14956#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14956#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:30,581 INFO L273 TraceCheckUtils]: 77: Hoare triple {14956#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:30,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {14957#(<= main_~i~0 18)} assume true; {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:30,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {14957#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:30,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {14957#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14957#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:30,583 INFO L273 TraceCheckUtils]: 81: Hoare triple {14957#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:30,584 INFO L273 TraceCheckUtils]: 82: Hoare triple {14958#(<= main_~i~0 19)} assume true; {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:30,584 INFO L273 TraceCheckUtils]: 83: Hoare triple {14958#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:30,585 INFO L273 TraceCheckUtils]: 84: Hoare triple {14958#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14958#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:30,585 INFO L273 TraceCheckUtils]: 85: Hoare triple {14958#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:30,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {14959#(<= main_~i~0 20)} assume true; {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:30,586 INFO L273 TraceCheckUtils]: 87: Hoare triple {14959#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:30,587 INFO L273 TraceCheckUtils]: 88: Hoare triple {14959#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14959#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:30,587 INFO L273 TraceCheckUtils]: 89: Hoare triple {14959#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:30,588 INFO L273 TraceCheckUtils]: 90: Hoare triple {14960#(<= main_~i~0 21)} assume true; {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:30,589 INFO L273 TraceCheckUtils]: 91: Hoare triple {14960#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:30,589 INFO L273 TraceCheckUtils]: 92: Hoare triple {14960#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14960#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:30,590 INFO L273 TraceCheckUtils]: 93: Hoare triple {14960#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:30,590 INFO L273 TraceCheckUtils]: 94: Hoare triple {14961#(<= main_~i~0 22)} assume true; {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:30,591 INFO L273 TraceCheckUtils]: 95: Hoare triple {14961#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:30,591 INFO L273 TraceCheckUtils]: 96: Hoare triple {14961#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14961#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:30,592 INFO L273 TraceCheckUtils]: 97: Hoare triple {14961#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:30,593 INFO L273 TraceCheckUtils]: 98: Hoare triple {14962#(<= main_~i~0 23)} assume true; {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:30,593 INFO L273 TraceCheckUtils]: 99: Hoare triple {14962#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:30,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {14962#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14962#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:30,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {14962#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:30,595 INFO L273 TraceCheckUtils]: 102: Hoare triple {14963#(<= main_~i~0 24)} assume true; {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:30,595 INFO L273 TraceCheckUtils]: 103: Hoare triple {14963#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:30,596 INFO L273 TraceCheckUtils]: 104: Hoare triple {14963#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14963#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:30,597 INFO L273 TraceCheckUtils]: 105: Hoare triple {14963#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14964#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:30,597 INFO L273 TraceCheckUtils]: 106: Hoare triple {14964#(<= main_~i~0 25)} assume true; {14964#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:30,598 INFO L273 TraceCheckUtils]: 107: Hoare triple {14964#(<= main_~i~0 25)} assume !(~i~0 < 100000); {14938#false} is VALID [2018-11-18 22:57:30,598 INFO L273 TraceCheckUtils]: 108: Hoare triple {14938#false} havoc ~x~0;~x~0 := 0; {14938#false} is VALID [2018-11-18 22:57:30,598 INFO L273 TraceCheckUtils]: 109: Hoare triple {14938#false} assume true; {14938#false} is VALID [2018-11-18 22:57:30,598 INFO L273 TraceCheckUtils]: 110: Hoare triple {14938#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {14938#false} is VALID [2018-11-18 22:57:30,599 INFO L256 TraceCheckUtils]: 111: Hoare triple {14938#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {14938#false} is VALID [2018-11-18 22:57:30,599 INFO L273 TraceCheckUtils]: 112: Hoare triple {14938#false} ~cond := #in~cond; {14938#false} is VALID [2018-11-18 22:57:30,599 INFO L273 TraceCheckUtils]: 113: Hoare triple {14938#false} assume 0 == ~cond; {14938#false} is VALID [2018-11-18 22:57:30,599 INFO L273 TraceCheckUtils]: 114: Hoare triple {14938#false} assume !false; {14938#false} is VALID [2018-11-18 22:57:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:30,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:30,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-18 22:57:30,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-18 22:57:30,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:30,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 22:57:30,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:30,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 22:57:30,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 22:57:30,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:57:30,744 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 29 states. [2018-11-18 22:57:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:31,676 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2018-11-18 22:57:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 22:57:31,676 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-11-18 22:57:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 183 transitions. [2018-11-18 22:57:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:57:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 183 transitions. [2018-11-18 22:57:31,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 183 transitions. [2018-11-18 22:57:31,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:31,959 INFO L225 Difference]: With dead ends: 150 [2018-11-18 22:57:31,959 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 22:57:31,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-18 22:57:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 22:57:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-18 22:57:31,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:31,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 130 states. [2018-11-18 22:57:31,985 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 130 states. [2018-11-18 22:57:31,985 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 130 states. [2018-11-18 22:57:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:31,988 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-18 22:57:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-18 22:57:31,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:31,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:31,989 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 132 states. [2018-11-18 22:57:31,989 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 132 states. [2018-11-18 22:57:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:31,991 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-18 22:57:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2018-11-18 22:57:31,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:31,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:31,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:31,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 22:57:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2018-11-18 22:57:31,994 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 115 [2018-11-18 22:57:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:31,994 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2018-11-18 22:57:31,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 22:57:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2018-11-18 22:57:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 22:57:31,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:31,995 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:31,995 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:31,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -423833048, now seen corresponding path program 26 times [2018-11-18 22:57:31,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:31,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:57:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:33,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {15931#true} call ULTIMATE.init(); {15931#true} is VALID [2018-11-18 22:57:33,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {15931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15931#true} is VALID [2018-11-18 22:57:33,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {15931#true} assume true; {15931#true} is VALID [2018-11-18 22:57:33,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15931#true} {15931#true} #73#return; {15931#true} is VALID [2018-11-18 22:57:33,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {15931#true} call #t~ret7 := main(); {15931#true} is VALID [2018-11-18 22:57:33,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {15931#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {15933#(= main_~i~0 0)} is VALID [2018-11-18 22:57:33,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {15933#(= main_~i~0 0)} assume true; {15933#(= main_~i~0 0)} is VALID [2018-11-18 22:57:33,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {15933#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15933#(= main_~i~0 0)} is VALID [2018-11-18 22:57:33,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {15933#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15933#(= main_~i~0 0)} is VALID [2018-11-18 22:57:33,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {15933#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {15934#(<= main_~i~0 1)} assume true; {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {15934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {15934#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {15934#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {15935#(<= main_~i~0 2)} assume true; {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {15935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {15935#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {15935#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {15936#(<= main_~i~0 3)} assume true; {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {15936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {15936#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {15936#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {15937#(<= main_~i~0 4)} assume true; {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {15937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {15937#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,088 INFO L273 TraceCheckUtils]: 25: Hoare triple {15937#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {15938#(<= main_~i~0 5)} assume true; {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {15938#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {15938#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {15938#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {15939#(<= main_~i~0 6)} assume true; {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {15939#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {15939#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {15939#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {15940#(<= main_~i~0 7)} assume true; {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {15940#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {15940#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {15940#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {15941#(<= main_~i~0 8)} assume true; {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {15941#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,094 INFO L273 TraceCheckUtils]: 40: Hoare triple {15941#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,095 INFO L273 TraceCheckUtils]: 41: Hoare triple {15941#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,095 INFO L273 TraceCheckUtils]: 42: Hoare triple {15942#(<= main_~i~0 9)} assume true; {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {15942#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {15942#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,097 INFO L273 TraceCheckUtils]: 45: Hoare triple {15942#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {15943#(<= main_~i~0 10)} assume true; {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {15943#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {15943#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {15943#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {15944#(<= main_~i~0 11)} assume true; {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,119 INFO L273 TraceCheckUtils]: 51: Hoare triple {15944#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {15944#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {15944#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {15945#(<= main_~i~0 12)} assume true; {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,121 INFO L273 TraceCheckUtils]: 55: Hoare triple {15945#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,121 INFO L273 TraceCheckUtils]: 56: Hoare triple {15945#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,121 INFO L273 TraceCheckUtils]: 57: Hoare triple {15945#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,122 INFO L273 TraceCheckUtils]: 58: Hoare triple {15946#(<= main_~i~0 13)} assume true; {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,122 INFO L273 TraceCheckUtils]: 59: Hoare triple {15946#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,123 INFO L273 TraceCheckUtils]: 60: Hoare triple {15946#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,123 INFO L273 TraceCheckUtils]: 61: Hoare triple {15946#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,124 INFO L273 TraceCheckUtils]: 62: Hoare triple {15947#(<= main_~i~0 14)} assume true; {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,124 INFO L273 TraceCheckUtils]: 63: Hoare triple {15947#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,125 INFO L273 TraceCheckUtils]: 64: Hoare triple {15947#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {15947#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,126 INFO L273 TraceCheckUtils]: 66: Hoare triple {15948#(<= main_~i~0 15)} assume true; {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,127 INFO L273 TraceCheckUtils]: 67: Hoare triple {15948#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,127 INFO L273 TraceCheckUtils]: 68: Hoare triple {15948#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {15948#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,128 INFO L273 TraceCheckUtils]: 70: Hoare triple {15949#(<= main_~i~0 16)} assume true; {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,129 INFO L273 TraceCheckUtils]: 71: Hoare triple {15949#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,129 INFO L273 TraceCheckUtils]: 72: Hoare triple {15949#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,130 INFO L273 TraceCheckUtils]: 73: Hoare triple {15949#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,130 INFO L273 TraceCheckUtils]: 74: Hoare triple {15950#(<= main_~i~0 17)} assume true; {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {15950#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {15950#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,132 INFO L273 TraceCheckUtils]: 77: Hoare triple {15950#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,132 INFO L273 TraceCheckUtils]: 78: Hoare triple {15951#(<= main_~i~0 18)} assume true; {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,133 INFO L273 TraceCheckUtils]: 79: Hoare triple {15951#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,133 INFO L273 TraceCheckUtils]: 80: Hoare triple {15951#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,134 INFO L273 TraceCheckUtils]: 81: Hoare triple {15951#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,134 INFO L273 TraceCheckUtils]: 82: Hoare triple {15952#(<= main_~i~0 19)} assume true; {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,135 INFO L273 TraceCheckUtils]: 83: Hoare triple {15952#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,135 INFO L273 TraceCheckUtils]: 84: Hoare triple {15952#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,136 INFO L273 TraceCheckUtils]: 85: Hoare triple {15952#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,137 INFO L273 TraceCheckUtils]: 86: Hoare triple {15953#(<= main_~i~0 20)} assume true; {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,137 INFO L273 TraceCheckUtils]: 87: Hoare triple {15953#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,138 INFO L273 TraceCheckUtils]: 88: Hoare triple {15953#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,138 INFO L273 TraceCheckUtils]: 89: Hoare triple {15953#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,139 INFO L273 TraceCheckUtils]: 90: Hoare triple {15954#(<= main_~i~0 21)} assume true; {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,139 INFO L273 TraceCheckUtils]: 91: Hoare triple {15954#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,140 INFO L273 TraceCheckUtils]: 92: Hoare triple {15954#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {15954#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,141 INFO L273 TraceCheckUtils]: 94: Hoare triple {15955#(<= main_~i~0 22)} assume true; {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,141 INFO L273 TraceCheckUtils]: 95: Hoare triple {15955#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,142 INFO L273 TraceCheckUtils]: 96: Hoare triple {15955#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,142 INFO L273 TraceCheckUtils]: 97: Hoare triple {15955#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,143 INFO L273 TraceCheckUtils]: 98: Hoare triple {15956#(<= main_~i~0 23)} assume true; {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,143 INFO L273 TraceCheckUtils]: 99: Hoare triple {15956#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,145 INFO L273 TraceCheckUtils]: 100: Hoare triple {15956#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,145 INFO L273 TraceCheckUtils]: 101: Hoare triple {15956#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,146 INFO L273 TraceCheckUtils]: 102: Hoare triple {15957#(<= main_~i~0 24)} assume true; {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,146 INFO L273 TraceCheckUtils]: 103: Hoare triple {15957#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,147 INFO L273 TraceCheckUtils]: 104: Hoare triple {15957#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,148 INFO L273 TraceCheckUtils]: 105: Hoare triple {15957#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,148 INFO L273 TraceCheckUtils]: 106: Hoare triple {15958#(<= main_~i~0 25)} assume true; {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,149 INFO L273 TraceCheckUtils]: 107: Hoare triple {15958#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,149 INFO L273 TraceCheckUtils]: 108: Hoare triple {15958#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,150 INFO L273 TraceCheckUtils]: 109: Hoare triple {15958#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15959#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:33,150 INFO L273 TraceCheckUtils]: 110: Hoare triple {15959#(<= main_~i~0 26)} assume true; {15959#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:33,151 INFO L273 TraceCheckUtils]: 111: Hoare triple {15959#(<= main_~i~0 26)} assume !(~i~0 < 100000); {15932#false} is VALID [2018-11-18 22:57:33,151 INFO L273 TraceCheckUtils]: 112: Hoare triple {15932#false} havoc ~x~0;~x~0 := 0; {15932#false} is VALID [2018-11-18 22:57:33,151 INFO L273 TraceCheckUtils]: 113: Hoare triple {15932#false} assume true; {15932#false} is VALID [2018-11-18 22:57:33,151 INFO L273 TraceCheckUtils]: 114: Hoare triple {15932#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {15932#false} is VALID [2018-11-18 22:57:33,152 INFO L256 TraceCheckUtils]: 115: Hoare triple {15932#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {15932#false} is VALID [2018-11-18 22:57:33,152 INFO L273 TraceCheckUtils]: 116: Hoare triple {15932#false} ~cond := #in~cond; {15932#false} is VALID [2018-11-18 22:57:33,152 INFO L273 TraceCheckUtils]: 117: Hoare triple {15932#false} assume 0 == ~cond; {15932#false} is VALID [2018-11-18 22:57:33,152 INFO L273 TraceCheckUtils]: 118: Hoare triple {15932#false} assume !false; {15932#false} is VALID [2018-11-18 22:57:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:33,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:33,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:33,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:57:33,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:57:33,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:33,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:33,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {15931#true} call ULTIMATE.init(); {15931#true} is VALID [2018-11-18 22:57:33,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {15931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15931#true} is VALID [2018-11-18 22:57:33,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {15931#true} assume true; {15931#true} is VALID [2018-11-18 22:57:33,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15931#true} {15931#true} #73#return; {15931#true} is VALID [2018-11-18 22:57:33,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {15931#true} call #t~ret7 := main(); {15931#true} is VALID [2018-11-18 22:57:33,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {15931#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {15978#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:33,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {15978#(<= main_~i~0 0)} assume true; {15978#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:33,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {15978#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15978#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:33,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {15978#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15978#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:33,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {15978#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {15934#(<= main_~i~0 1)} assume true; {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {15934#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {15934#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15934#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:33,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {15934#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {15935#(<= main_~i~0 2)} assume true; {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {15935#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {15935#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15935#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:33,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {15935#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {15936#(<= main_~i~0 3)} assume true; {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {15936#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {15936#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15936#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:33,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {15936#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {15937#(<= main_~i~0 4)} assume true; {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {15937#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {15937#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15937#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:33,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {15937#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {15938#(<= main_~i~0 5)} assume true; {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {15938#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {15938#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15938#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:33,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {15938#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,490 INFO L273 TraceCheckUtils]: 30: Hoare triple {15939#(<= main_~i~0 6)} assume true; {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {15939#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {15939#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15939#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:33,491 INFO L273 TraceCheckUtils]: 33: Hoare triple {15939#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,492 INFO L273 TraceCheckUtils]: 34: Hoare triple {15940#(<= main_~i~0 7)} assume true; {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,492 INFO L273 TraceCheckUtils]: 35: Hoare triple {15940#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {15940#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15940#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:33,493 INFO L273 TraceCheckUtils]: 37: Hoare triple {15940#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {15941#(<= main_~i~0 8)} assume true; {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {15941#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {15941#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15941#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:33,496 INFO L273 TraceCheckUtils]: 41: Hoare triple {15941#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,496 INFO L273 TraceCheckUtils]: 42: Hoare triple {15942#(<= main_~i~0 9)} assume true; {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {15942#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {15942#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15942#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:33,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {15942#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,546 INFO L273 TraceCheckUtils]: 46: Hoare triple {15943#(<= main_~i~0 10)} assume true; {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,560 INFO L273 TraceCheckUtils]: 47: Hoare triple {15943#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,568 INFO L273 TraceCheckUtils]: 48: Hoare triple {15943#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15943#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:33,575 INFO L273 TraceCheckUtils]: 49: Hoare triple {15943#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,576 INFO L273 TraceCheckUtils]: 50: Hoare triple {15944#(<= main_~i~0 11)} assume true; {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,576 INFO L273 TraceCheckUtils]: 51: Hoare triple {15944#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,578 INFO L273 TraceCheckUtils]: 52: Hoare triple {15944#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15944#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:33,578 INFO L273 TraceCheckUtils]: 53: Hoare triple {15944#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {15945#(<= main_~i~0 12)} assume true; {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,581 INFO L273 TraceCheckUtils]: 55: Hoare triple {15945#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {15945#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15945#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:33,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {15945#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,582 INFO L273 TraceCheckUtils]: 58: Hoare triple {15946#(<= main_~i~0 13)} assume true; {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {15946#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,583 INFO L273 TraceCheckUtils]: 60: Hoare triple {15946#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15946#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:33,583 INFO L273 TraceCheckUtils]: 61: Hoare triple {15946#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {15947#(<= main_~i~0 14)} assume true; {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,584 INFO L273 TraceCheckUtils]: 63: Hoare triple {15947#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,584 INFO L273 TraceCheckUtils]: 64: Hoare triple {15947#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15947#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:33,584 INFO L273 TraceCheckUtils]: 65: Hoare triple {15947#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,585 INFO L273 TraceCheckUtils]: 66: Hoare triple {15948#(<= main_~i~0 15)} assume true; {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,585 INFO L273 TraceCheckUtils]: 67: Hoare triple {15948#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,586 INFO L273 TraceCheckUtils]: 68: Hoare triple {15948#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15948#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:33,586 INFO L273 TraceCheckUtils]: 69: Hoare triple {15948#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,587 INFO L273 TraceCheckUtils]: 70: Hoare triple {15949#(<= main_~i~0 16)} assume true; {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,587 INFO L273 TraceCheckUtils]: 71: Hoare triple {15949#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,588 INFO L273 TraceCheckUtils]: 72: Hoare triple {15949#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15949#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:33,589 INFO L273 TraceCheckUtils]: 73: Hoare triple {15949#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,589 INFO L273 TraceCheckUtils]: 74: Hoare triple {15950#(<= main_~i~0 17)} assume true; {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,590 INFO L273 TraceCheckUtils]: 75: Hoare triple {15950#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,590 INFO L273 TraceCheckUtils]: 76: Hoare triple {15950#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15950#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:33,591 INFO L273 TraceCheckUtils]: 77: Hoare triple {15950#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,591 INFO L273 TraceCheckUtils]: 78: Hoare triple {15951#(<= main_~i~0 18)} assume true; {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,592 INFO L273 TraceCheckUtils]: 79: Hoare triple {15951#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,592 INFO L273 TraceCheckUtils]: 80: Hoare triple {15951#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15951#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:33,593 INFO L273 TraceCheckUtils]: 81: Hoare triple {15951#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,593 INFO L273 TraceCheckUtils]: 82: Hoare triple {15952#(<= main_~i~0 19)} assume true; {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,594 INFO L273 TraceCheckUtils]: 83: Hoare triple {15952#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,594 INFO L273 TraceCheckUtils]: 84: Hoare triple {15952#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15952#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:33,595 INFO L273 TraceCheckUtils]: 85: Hoare triple {15952#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,595 INFO L273 TraceCheckUtils]: 86: Hoare triple {15953#(<= main_~i~0 20)} assume true; {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,596 INFO L273 TraceCheckUtils]: 87: Hoare triple {15953#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,596 INFO L273 TraceCheckUtils]: 88: Hoare triple {15953#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15953#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:33,597 INFO L273 TraceCheckUtils]: 89: Hoare triple {15953#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,597 INFO L273 TraceCheckUtils]: 90: Hoare triple {15954#(<= main_~i~0 21)} assume true; {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,598 INFO L273 TraceCheckUtils]: 91: Hoare triple {15954#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,598 INFO L273 TraceCheckUtils]: 92: Hoare triple {15954#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15954#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:33,599 INFO L273 TraceCheckUtils]: 93: Hoare triple {15954#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,600 INFO L273 TraceCheckUtils]: 94: Hoare triple {15955#(<= main_~i~0 22)} assume true; {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,600 INFO L273 TraceCheckUtils]: 95: Hoare triple {15955#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,601 INFO L273 TraceCheckUtils]: 96: Hoare triple {15955#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15955#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:33,601 INFO L273 TraceCheckUtils]: 97: Hoare triple {15955#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,602 INFO L273 TraceCheckUtils]: 98: Hoare triple {15956#(<= main_~i~0 23)} assume true; {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,602 INFO L273 TraceCheckUtils]: 99: Hoare triple {15956#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,603 INFO L273 TraceCheckUtils]: 100: Hoare triple {15956#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15956#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:33,603 INFO L273 TraceCheckUtils]: 101: Hoare triple {15956#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,604 INFO L273 TraceCheckUtils]: 102: Hoare triple {15957#(<= main_~i~0 24)} assume true; {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,604 INFO L273 TraceCheckUtils]: 103: Hoare triple {15957#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,605 INFO L273 TraceCheckUtils]: 104: Hoare triple {15957#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15957#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:33,605 INFO L273 TraceCheckUtils]: 105: Hoare triple {15957#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,606 INFO L273 TraceCheckUtils]: 106: Hoare triple {15958#(<= main_~i~0 25)} assume true; {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,606 INFO L273 TraceCheckUtils]: 107: Hoare triple {15958#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,607 INFO L273 TraceCheckUtils]: 108: Hoare triple {15958#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15958#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:33,608 INFO L273 TraceCheckUtils]: 109: Hoare triple {15958#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15959#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:33,608 INFO L273 TraceCheckUtils]: 110: Hoare triple {15959#(<= main_~i~0 26)} assume true; {15959#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:33,609 INFO L273 TraceCheckUtils]: 111: Hoare triple {15959#(<= main_~i~0 26)} assume !(~i~0 < 100000); {15932#false} is VALID [2018-11-18 22:57:33,609 INFO L273 TraceCheckUtils]: 112: Hoare triple {15932#false} havoc ~x~0;~x~0 := 0; {15932#false} is VALID [2018-11-18 22:57:33,609 INFO L273 TraceCheckUtils]: 113: Hoare triple {15932#false} assume true; {15932#false} is VALID [2018-11-18 22:57:33,609 INFO L273 TraceCheckUtils]: 114: Hoare triple {15932#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {15932#false} is VALID [2018-11-18 22:57:33,609 INFO L256 TraceCheckUtils]: 115: Hoare triple {15932#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {15932#false} is VALID [2018-11-18 22:57:33,610 INFO L273 TraceCheckUtils]: 116: Hoare triple {15932#false} ~cond := #in~cond; {15932#false} is VALID [2018-11-18 22:57:33,610 INFO L273 TraceCheckUtils]: 117: Hoare triple {15932#false} assume 0 == ~cond; {15932#false} is VALID [2018-11-18 22:57:33,610 INFO L273 TraceCheckUtils]: 118: Hoare triple {15932#false} assume !false; {15932#false} is VALID [2018-11-18 22:57:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:33,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:33,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-18 22:57:33,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-18 22:57:33,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:33,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-18 22:57:33,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:33,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 22:57:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 22:57:33,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:33,750 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand 30 states. [2018-11-18 22:57:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:34,454 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-11-18 22:57:34,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 22:57:34,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-11-18 22:57:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:57:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 188 transitions. [2018-11-18 22:57:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:57:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 188 transitions. [2018-11-18 22:57:34,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 188 transitions. [2018-11-18 22:57:34,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:34,745 INFO L225 Difference]: With dead ends: 154 [2018-11-18 22:57:34,745 INFO L226 Difference]: Without dead ends: 136 [2018-11-18 22:57:34,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-18 22:57:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-18 22:57:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-18 22:57:34,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:34,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-18 22:57:34,771 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-18 22:57:34,771 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-18 22:57:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:34,774 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2018-11-18 22:57:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2018-11-18 22:57:34,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:34,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:34,775 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-18 22:57:34,775 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-18 22:57:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:34,777 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2018-11-18 22:57:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2018-11-18 22:57:34,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:34,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:34,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:34,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-18 22:57:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 164 transitions. [2018-11-18 22:57:34,780 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 164 transitions. Word has length 119 [2018-11-18 22:57:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:34,781 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 164 transitions. [2018-11-18 22:57:34,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 22:57:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-18 22:57:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-18 22:57:34,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:34,782 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:34,782 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:34,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1601581375, now seen corresponding path program 27 times [2018-11-18 22:57:34,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:34,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:35,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {16956#true} call ULTIMATE.init(); {16956#true} is VALID [2018-11-18 22:57:35,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {16956#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16956#true} is VALID [2018-11-18 22:57:35,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {16956#true} assume true; {16956#true} is VALID [2018-11-18 22:57:35,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16956#true} {16956#true} #73#return; {16956#true} is VALID [2018-11-18 22:57:35,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {16956#true} call #t~ret7 := main(); {16956#true} is VALID [2018-11-18 22:57:35,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {16956#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {16958#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {16958#(= main_~i~0 0)} assume true; {16958#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {16958#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16958#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {16958#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16958#(= main_~i~0 0)} is VALID [2018-11-18 22:57:35,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {16958#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {16959#(<= main_~i~0 1)} assume true; {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {16959#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {16959#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:35,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {16959#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {16960#(<= main_~i~0 2)} assume true; {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {16960#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {16960#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:35,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {16960#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {16961#(<= main_~i~0 3)} assume true; {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {16961#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {16961#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:35,301 INFO L273 TraceCheckUtils]: 21: Hoare triple {16961#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {16962#(<= main_~i~0 4)} assume true; {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {16962#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {16962#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:35,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {16962#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {16963#(<= main_~i~0 5)} assume true; {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,304 INFO L273 TraceCheckUtils]: 27: Hoare triple {16963#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,305 INFO L273 TraceCheckUtils]: 28: Hoare triple {16963#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:35,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {16963#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {16964#(<= main_~i~0 6)} assume true; {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,307 INFO L273 TraceCheckUtils]: 31: Hoare triple {16964#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,307 INFO L273 TraceCheckUtils]: 32: Hoare triple {16964#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:35,308 INFO L273 TraceCheckUtils]: 33: Hoare triple {16964#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,308 INFO L273 TraceCheckUtils]: 34: Hoare triple {16965#(<= main_~i~0 7)} assume true; {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {16965#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {16965#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:35,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {16965#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {16966#(<= main_~i~0 8)} assume true; {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {16966#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,312 INFO L273 TraceCheckUtils]: 40: Hoare triple {16966#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:35,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {16966#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,313 INFO L273 TraceCheckUtils]: 42: Hoare triple {16967#(<= main_~i~0 9)} assume true; {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {16967#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {16967#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:35,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {16967#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {16968#(<= main_~i~0 10)} assume true; {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {16968#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {16968#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:35,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {16968#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {16969#(<= main_~i~0 11)} assume true; {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {16969#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {16969#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:35,319 INFO L273 TraceCheckUtils]: 53: Hoare triple {16969#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,320 INFO L273 TraceCheckUtils]: 54: Hoare triple {16970#(<= main_~i~0 12)} assume true; {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,320 INFO L273 TraceCheckUtils]: 55: Hoare triple {16970#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {16970#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:35,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {16970#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,322 INFO L273 TraceCheckUtils]: 58: Hoare triple {16971#(<= main_~i~0 13)} assume true; {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {16971#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,323 INFO L273 TraceCheckUtils]: 60: Hoare triple {16971#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:35,324 INFO L273 TraceCheckUtils]: 61: Hoare triple {16971#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {16972#(<= main_~i~0 14)} assume true; {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,325 INFO L273 TraceCheckUtils]: 63: Hoare triple {16972#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {16972#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:35,326 INFO L273 TraceCheckUtils]: 65: Hoare triple {16972#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,326 INFO L273 TraceCheckUtils]: 66: Hoare triple {16973#(<= main_~i~0 15)} assume true; {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,327 INFO L273 TraceCheckUtils]: 67: Hoare triple {16973#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,327 INFO L273 TraceCheckUtils]: 68: Hoare triple {16973#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:35,328 INFO L273 TraceCheckUtils]: 69: Hoare triple {16973#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,329 INFO L273 TraceCheckUtils]: 70: Hoare triple {16974#(<= main_~i~0 16)} assume true; {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,329 INFO L273 TraceCheckUtils]: 71: Hoare triple {16974#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,330 INFO L273 TraceCheckUtils]: 72: Hoare triple {16974#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:35,330 INFO L273 TraceCheckUtils]: 73: Hoare triple {16974#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,331 INFO L273 TraceCheckUtils]: 74: Hoare triple {16975#(<= main_~i~0 17)} assume true; {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,331 INFO L273 TraceCheckUtils]: 75: Hoare triple {16975#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,332 INFO L273 TraceCheckUtils]: 76: Hoare triple {16975#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:35,333 INFO L273 TraceCheckUtils]: 77: Hoare triple {16975#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,333 INFO L273 TraceCheckUtils]: 78: Hoare triple {16976#(<= main_~i~0 18)} assume true; {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,334 INFO L273 TraceCheckUtils]: 79: Hoare triple {16976#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,334 INFO L273 TraceCheckUtils]: 80: Hoare triple {16976#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:35,335 INFO L273 TraceCheckUtils]: 81: Hoare triple {16976#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {16977#(<= main_~i~0 19)} assume true; {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,336 INFO L273 TraceCheckUtils]: 83: Hoare triple {16977#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,336 INFO L273 TraceCheckUtils]: 84: Hoare triple {16977#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:35,337 INFO L273 TraceCheckUtils]: 85: Hoare triple {16977#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,337 INFO L273 TraceCheckUtils]: 86: Hoare triple {16978#(<= main_~i~0 20)} assume true; {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,338 INFO L273 TraceCheckUtils]: 87: Hoare triple {16978#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,338 INFO L273 TraceCheckUtils]: 88: Hoare triple {16978#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:35,339 INFO L273 TraceCheckUtils]: 89: Hoare triple {16978#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,340 INFO L273 TraceCheckUtils]: 90: Hoare triple {16979#(<= main_~i~0 21)} assume true; {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,340 INFO L273 TraceCheckUtils]: 91: Hoare triple {16979#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,341 INFO L273 TraceCheckUtils]: 92: Hoare triple {16979#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:35,341 INFO L273 TraceCheckUtils]: 93: Hoare triple {16979#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,342 INFO L273 TraceCheckUtils]: 94: Hoare triple {16980#(<= main_~i~0 22)} assume true; {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,342 INFO L273 TraceCheckUtils]: 95: Hoare triple {16980#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,343 INFO L273 TraceCheckUtils]: 96: Hoare triple {16980#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:35,344 INFO L273 TraceCheckUtils]: 97: Hoare triple {16980#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,344 INFO L273 TraceCheckUtils]: 98: Hoare triple {16981#(<= main_~i~0 23)} assume true; {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,345 INFO L273 TraceCheckUtils]: 99: Hoare triple {16981#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,345 INFO L273 TraceCheckUtils]: 100: Hoare triple {16981#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:35,346 INFO L273 TraceCheckUtils]: 101: Hoare triple {16981#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,346 INFO L273 TraceCheckUtils]: 102: Hoare triple {16982#(<= main_~i~0 24)} assume true; {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,347 INFO L273 TraceCheckUtils]: 103: Hoare triple {16982#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,347 INFO L273 TraceCheckUtils]: 104: Hoare triple {16982#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:35,348 INFO L273 TraceCheckUtils]: 105: Hoare triple {16982#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,349 INFO L273 TraceCheckUtils]: 106: Hoare triple {16983#(<= main_~i~0 25)} assume true; {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,349 INFO L273 TraceCheckUtils]: 107: Hoare triple {16983#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,350 INFO L273 TraceCheckUtils]: 108: Hoare triple {16983#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:35,350 INFO L273 TraceCheckUtils]: 109: Hoare triple {16983#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,351 INFO L273 TraceCheckUtils]: 110: Hoare triple {16984#(<= main_~i~0 26)} assume true; {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,351 INFO L273 TraceCheckUtils]: 111: Hoare triple {16984#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,352 INFO L273 TraceCheckUtils]: 112: Hoare triple {16984#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:35,352 INFO L273 TraceCheckUtils]: 113: Hoare triple {16984#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16985#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,353 INFO L273 TraceCheckUtils]: 114: Hoare triple {16985#(<= main_~i~0 27)} assume true; {16985#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:35,354 INFO L273 TraceCheckUtils]: 115: Hoare triple {16985#(<= main_~i~0 27)} assume !(~i~0 < 100000); {16957#false} is VALID [2018-11-18 22:57:35,354 INFO L273 TraceCheckUtils]: 116: Hoare triple {16957#false} havoc ~x~0;~x~0 := 0; {16957#false} is VALID [2018-11-18 22:57:35,354 INFO L273 TraceCheckUtils]: 117: Hoare triple {16957#false} assume true; {16957#false} is VALID [2018-11-18 22:57:35,354 INFO L273 TraceCheckUtils]: 118: Hoare triple {16957#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {16957#false} is VALID [2018-11-18 22:57:35,354 INFO L256 TraceCheckUtils]: 119: Hoare triple {16957#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {16957#false} is VALID [2018-11-18 22:57:35,354 INFO L273 TraceCheckUtils]: 120: Hoare triple {16957#false} ~cond := #in~cond; {16957#false} is VALID [2018-11-18 22:57:35,355 INFO L273 TraceCheckUtils]: 121: Hoare triple {16957#false} assume 0 == ~cond; {16957#false} is VALID [2018-11-18 22:57:35,355 INFO L273 TraceCheckUtils]: 122: Hoare triple {16957#false} assume !false; {16957#false} is VALID [2018-11-18 22:57:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:35,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:35,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:35,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:57:37,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-18 22:57:37,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:37,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:38,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {16956#true} call ULTIMATE.init(); {16956#true} is VALID [2018-11-18 22:57:38,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {16956#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16956#true} is VALID [2018-11-18 22:57:38,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {16956#true} assume true; {16956#true} is VALID [2018-11-18 22:57:38,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16956#true} {16956#true} #73#return; {16956#true} is VALID [2018-11-18 22:57:38,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {16956#true} call #t~ret7 := main(); {16956#true} is VALID [2018-11-18 22:57:38,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {16956#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {17004#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:38,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {17004#(<= main_~i~0 0)} assume true; {17004#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:38,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {17004#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17004#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:38,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {17004#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17004#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:38,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {17004#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:38,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {16959#(<= main_~i~0 1)} assume true; {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:38,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {16959#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:38,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {16959#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16959#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:38,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {16959#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:38,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {16960#(<= main_~i~0 2)} assume true; {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:38,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {16960#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:38,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {16960#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16960#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:38,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {16960#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:38,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {16961#(<= main_~i~0 3)} assume true; {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:38,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {16961#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:38,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {16961#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16961#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:38,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {16961#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:38,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {16962#(<= main_~i~0 4)} assume true; {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:38,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {16962#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:38,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {16962#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16962#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:38,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {16962#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:38,309 INFO L273 TraceCheckUtils]: 26: Hoare triple {16963#(<= main_~i~0 5)} assume true; {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:38,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {16963#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:38,310 INFO L273 TraceCheckUtils]: 28: Hoare triple {16963#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16963#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:38,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {16963#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:38,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {16964#(<= main_~i~0 6)} assume true; {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:38,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {16964#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:38,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {16964#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16964#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:38,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {16964#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:38,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {16965#(<= main_~i~0 7)} assume true; {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:38,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {16965#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:38,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {16965#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16965#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:38,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {16965#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:38,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {16966#(<= main_~i~0 8)} assume true; {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:38,317 INFO L273 TraceCheckUtils]: 39: Hoare triple {16966#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:38,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {16966#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16966#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:38,319 INFO L273 TraceCheckUtils]: 41: Hoare triple {16966#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:38,319 INFO L273 TraceCheckUtils]: 42: Hoare triple {16967#(<= main_~i~0 9)} assume true; {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:38,320 INFO L273 TraceCheckUtils]: 43: Hoare triple {16967#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:38,320 INFO L273 TraceCheckUtils]: 44: Hoare triple {16967#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16967#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:38,321 INFO L273 TraceCheckUtils]: 45: Hoare triple {16967#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:38,322 INFO L273 TraceCheckUtils]: 46: Hoare triple {16968#(<= main_~i~0 10)} assume true; {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:38,322 INFO L273 TraceCheckUtils]: 47: Hoare triple {16968#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:38,323 INFO L273 TraceCheckUtils]: 48: Hoare triple {16968#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16968#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:38,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {16968#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:38,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {16969#(<= main_~i~0 11)} assume true; {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:38,325 INFO L273 TraceCheckUtils]: 51: Hoare triple {16969#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:38,326 INFO L273 TraceCheckUtils]: 52: Hoare triple {16969#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16969#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:38,327 INFO L273 TraceCheckUtils]: 53: Hoare triple {16969#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:38,327 INFO L273 TraceCheckUtils]: 54: Hoare triple {16970#(<= main_~i~0 12)} assume true; {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:38,328 INFO L273 TraceCheckUtils]: 55: Hoare triple {16970#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:38,328 INFO L273 TraceCheckUtils]: 56: Hoare triple {16970#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16970#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:38,329 INFO L273 TraceCheckUtils]: 57: Hoare triple {16970#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:38,330 INFO L273 TraceCheckUtils]: 58: Hoare triple {16971#(<= main_~i~0 13)} assume true; {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:38,330 INFO L273 TraceCheckUtils]: 59: Hoare triple {16971#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:38,331 INFO L273 TraceCheckUtils]: 60: Hoare triple {16971#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16971#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:38,332 INFO L273 TraceCheckUtils]: 61: Hoare triple {16971#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:38,332 INFO L273 TraceCheckUtils]: 62: Hoare triple {16972#(<= main_~i~0 14)} assume true; {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:38,333 INFO L273 TraceCheckUtils]: 63: Hoare triple {16972#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:38,334 INFO L273 TraceCheckUtils]: 64: Hoare triple {16972#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16972#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:38,334 INFO L273 TraceCheckUtils]: 65: Hoare triple {16972#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:38,335 INFO L273 TraceCheckUtils]: 66: Hoare triple {16973#(<= main_~i~0 15)} assume true; {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:38,336 INFO L273 TraceCheckUtils]: 67: Hoare triple {16973#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:38,336 INFO L273 TraceCheckUtils]: 68: Hoare triple {16973#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16973#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:38,337 INFO L273 TraceCheckUtils]: 69: Hoare triple {16973#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:38,338 INFO L273 TraceCheckUtils]: 70: Hoare triple {16974#(<= main_~i~0 16)} assume true; {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:38,338 INFO L273 TraceCheckUtils]: 71: Hoare triple {16974#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:38,339 INFO L273 TraceCheckUtils]: 72: Hoare triple {16974#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16974#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:38,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {16974#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:38,340 INFO L273 TraceCheckUtils]: 74: Hoare triple {16975#(<= main_~i~0 17)} assume true; {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:38,341 INFO L273 TraceCheckUtils]: 75: Hoare triple {16975#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:38,342 INFO L273 TraceCheckUtils]: 76: Hoare triple {16975#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16975#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:38,342 INFO L273 TraceCheckUtils]: 77: Hoare triple {16975#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:38,343 INFO L273 TraceCheckUtils]: 78: Hoare triple {16976#(<= main_~i~0 18)} assume true; {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:38,344 INFO L273 TraceCheckUtils]: 79: Hoare triple {16976#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:38,344 INFO L273 TraceCheckUtils]: 80: Hoare triple {16976#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16976#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:38,345 INFO L273 TraceCheckUtils]: 81: Hoare triple {16976#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:38,346 INFO L273 TraceCheckUtils]: 82: Hoare triple {16977#(<= main_~i~0 19)} assume true; {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:38,346 INFO L273 TraceCheckUtils]: 83: Hoare triple {16977#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:38,347 INFO L273 TraceCheckUtils]: 84: Hoare triple {16977#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16977#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:38,348 INFO L273 TraceCheckUtils]: 85: Hoare triple {16977#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:38,348 INFO L273 TraceCheckUtils]: 86: Hoare triple {16978#(<= main_~i~0 20)} assume true; {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:38,349 INFO L273 TraceCheckUtils]: 87: Hoare triple {16978#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:38,350 INFO L273 TraceCheckUtils]: 88: Hoare triple {16978#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16978#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:38,350 INFO L273 TraceCheckUtils]: 89: Hoare triple {16978#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:38,351 INFO L273 TraceCheckUtils]: 90: Hoare triple {16979#(<= main_~i~0 21)} assume true; {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:38,352 INFO L273 TraceCheckUtils]: 91: Hoare triple {16979#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:38,352 INFO L273 TraceCheckUtils]: 92: Hoare triple {16979#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16979#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:38,353 INFO L273 TraceCheckUtils]: 93: Hoare triple {16979#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:38,354 INFO L273 TraceCheckUtils]: 94: Hoare triple {16980#(<= main_~i~0 22)} assume true; {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:38,354 INFO L273 TraceCheckUtils]: 95: Hoare triple {16980#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:38,355 INFO L273 TraceCheckUtils]: 96: Hoare triple {16980#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16980#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:38,356 INFO L273 TraceCheckUtils]: 97: Hoare triple {16980#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:38,356 INFO L273 TraceCheckUtils]: 98: Hoare triple {16981#(<= main_~i~0 23)} assume true; {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:38,357 INFO L273 TraceCheckUtils]: 99: Hoare triple {16981#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:38,357 INFO L273 TraceCheckUtils]: 100: Hoare triple {16981#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16981#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:38,358 INFO L273 TraceCheckUtils]: 101: Hoare triple {16981#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:38,359 INFO L273 TraceCheckUtils]: 102: Hoare triple {16982#(<= main_~i~0 24)} assume true; {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:38,359 INFO L273 TraceCheckUtils]: 103: Hoare triple {16982#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:38,360 INFO L273 TraceCheckUtils]: 104: Hoare triple {16982#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16982#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:38,361 INFO L273 TraceCheckUtils]: 105: Hoare triple {16982#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:38,361 INFO L273 TraceCheckUtils]: 106: Hoare triple {16983#(<= main_~i~0 25)} assume true; {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:38,362 INFO L273 TraceCheckUtils]: 107: Hoare triple {16983#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:38,363 INFO L273 TraceCheckUtils]: 108: Hoare triple {16983#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16983#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:38,363 INFO L273 TraceCheckUtils]: 109: Hoare triple {16983#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:38,364 INFO L273 TraceCheckUtils]: 110: Hoare triple {16984#(<= main_~i~0 26)} assume true; {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:38,365 INFO L273 TraceCheckUtils]: 111: Hoare triple {16984#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:38,365 INFO L273 TraceCheckUtils]: 112: Hoare triple {16984#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16984#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:38,366 INFO L273 TraceCheckUtils]: 113: Hoare triple {16984#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16985#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:38,367 INFO L273 TraceCheckUtils]: 114: Hoare triple {16985#(<= main_~i~0 27)} assume true; {16985#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:38,367 INFO L273 TraceCheckUtils]: 115: Hoare triple {16985#(<= main_~i~0 27)} assume !(~i~0 < 100000); {16957#false} is VALID [2018-11-18 22:57:38,368 INFO L273 TraceCheckUtils]: 116: Hoare triple {16957#false} havoc ~x~0;~x~0 := 0; {16957#false} is VALID [2018-11-18 22:57:38,368 INFO L273 TraceCheckUtils]: 117: Hoare triple {16957#false} assume true; {16957#false} is VALID [2018-11-18 22:57:38,368 INFO L273 TraceCheckUtils]: 118: Hoare triple {16957#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {16957#false} is VALID [2018-11-18 22:57:38,368 INFO L256 TraceCheckUtils]: 119: Hoare triple {16957#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {16957#false} is VALID [2018-11-18 22:57:38,369 INFO L273 TraceCheckUtils]: 120: Hoare triple {16957#false} ~cond := #in~cond; {16957#false} is VALID [2018-11-18 22:57:38,369 INFO L273 TraceCheckUtils]: 121: Hoare triple {16957#false} assume 0 == ~cond; {16957#false} is VALID [2018-11-18 22:57:38,369 INFO L273 TraceCheckUtils]: 122: Hoare triple {16957#false} assume !false; {16957#false} is VALID [2018-11-18 22:57:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:38,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:38,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-18 22:57:38,430 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-18 22:57:38,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:38,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-18 22:57:38,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:38,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 22:57:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 22:57:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:57:38,563 INFO L87 Difference]: Start difference. First operand 134 states and 164 transitions. Second operand 31 states. [2018-11-18 22:57:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:39,609 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2018-11-18 22:57:39,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 22:57:39,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2018-11-18 22:57:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:57:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 193 transitions. [2018-11-18 22:57:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 22:57:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 193 transitions. [2018-11-18 22:57:39,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 193 transitions. [2018-11-18 22:57:39,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:39,790 INFO L225 Difference]: With dead ends: 158 [2018-11-18 22:57:39,790 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 22:57:39,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-18 22:57:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 22:57:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-11-18 22:57:39,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:39,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 138 states. [2018-11-18 22:57:39,822 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 138 states. [2018-11-18 22:57:39,822 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 138 states. [2018-11-18 22:57:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:39,825 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2018-11-18 22:57:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2018-11-18 22:57:39,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:39,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:39,826 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 140 states. [2018-11-18 22:57:39,826 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 140 states. [2018-11-18 22:57:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:39,829 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2018-11-18 22:57:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2018-11-18 22:57:39,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:39,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:39,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:39,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 22:57:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2018-11-18 22:57:39,832 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 123 [2018-11-18 22:57:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:39,832 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2018-11-18 22:57:39,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 22:57:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2018-11-18 22:57:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 22:57:39,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:39,833 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:39,834 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:39,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:39,834 INFO L82 PathProgramCache]: Analyzing trace with hash 262941910, now seen corresponding path program 28 times [2018-11-18 22:57:39,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:39,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:39,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:40,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18012#true} is VALID [2018-11-18 22:57:40,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {18012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18012#true} is VALID [2018-11-18 22:57:40,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2018-11-18 22:57:40,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #73#return; {18012#true} is VALID [2018-11-18 22:57:40,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret7 := main(); {18012#true} is VALID [2018-11-18 22:57:40,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {18012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {18014#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {18014#(= main_~i~0 0)} assume true; {18014#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {18014#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18014#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {18014#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18014#(= main_~i~0 0)} is VALID [2018-11-18 22:57:40,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {18014#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {18015#(<= main_~i~0 1)} assume true; {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {18015#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {18015#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:40,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {18015#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {18016#(<= main_~i~0 2)} assume true; {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {18016#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {18016#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:40,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {18016#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {18017#(<= main_~i~0 3)} assume true; {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {18017#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {18017#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:40,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {18017#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {18018#(<= main_~i~0 4)} assume true; {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {18018#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {18018#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:40,588 INFO L273 TraceCheckUtils]: 25: Hoare triple {18018#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {18019#(<= main_~i~0 5)} assume true; {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {18019#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {18019#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:40,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {18019#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {18020#(<= main_~i~0 6)} assume true; {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {18020#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {18020#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:40,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {18020#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {18021#(<= main_~i~0 7)} assume true; {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {18021#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {18021#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:40,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {18021#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {18022#(<= main_~i~0 8)} assume true; {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {18022#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {18022#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:40,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {18022#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {18023#(<= main_~i~0 9)} assume true; {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {18023#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,598 INFO L273 TraceCheckUtils]: 44: Hoare triple {18023#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:40,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {18023#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {18024#(<= main_~i~0 10)} assume true; {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,600 INFO L273 TraceCheckUtils]: 47: Hoare triple {18024#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,600 INFO L273 TraceCheckUtils]: 48: Hoare triple {18024#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:40,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {18024#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {18025#(<= main_~i~0 11)} assume true; {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {18025#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {18025#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:40,603 INFO L273 TraceCheckUtils]: 53: Hoare triple {18025#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {18026#(<= main_~i~0 12)} assume true; {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,604 INFO L273 TraceCheckUtils]: 55: Hoare triple {18026#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,605 INFO L273 TraceCheckUtils]: 56: Hoare triple {18026#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:40,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {18026#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,606 INFO L273 TraceCheckUtils]: 58: Hoare triple {18027#(<= main_~i~0 13)} assume true; {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,606 INFO L273 TraceCheckUtils]: 59: Hoare triple {18027#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,607 INFO L273 TraceCheckUtils]: 60: Hoare triple {18027#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:40,608 INFO L273 TraceCheckUtils]: 61: Hoare triple {18027#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,608 INFO L273 TraceCheckUtils]: 62: Hoare triple {18028#(<= main_~i~0 14)} assume true; {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,609 INFO L273 TraceCheckUtils]: 63: Hoare triple {18028#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,609 INFO L273 TraceCheckUtils]: 64: Hoare triple {18028#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:40,610 INFO L273 TraceCheckUtils]: 65: Hoare triple {18028#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,610 INFO L273 TraceCheckUtils]: 66: Hoare triple {18029#(<= main_~i~0 15)} assume true; {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,611 INFO L273 TraceCheckUtils]: 67: Hoare triple {18029#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,611 INFO L273 TraceCheckUtils]: 68: Hoare triple {18029#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:40,612 INFO L273 TraceCheckUtils]: 69: Hoare triple {18029#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,612 INFO L273 TraceCheckUtils]: 70: Hoare triple {18030#(<= main_~i~0 16)} assume true; {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,613 INFO L273 TraceCheckUtils]: 71: Hoare triple {18030#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,613 INFO L273 TraceCheckUtils]: 72: Hoare triple {18030#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:40,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {18030#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {18031#(<= main_~i~0 17)} assume true; {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,615 INFO L273 TraceCheckUtils]: 75: Hoare triple {18031#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,615 INFO L273 TraceCheckUtils]: 76: Hoare triple {18031#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:40,616 INFO L273 TraceCheckUtils]: 77: Hoare triple {18031#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,616 INFO L273 TraceCheckUtils]: 78: Hoare triple {18032#(<= main_~i~0 18)} assume true; {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,617 INFO L273 TraceCheckUtils]: 79: Hoare triple {18032#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,617 INFO L273 TraceCheckUtils]: 80: Hoare triple {18032#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:40,618 INFO L273 TraceCheckUtils]: 81: Hoare triple {18032#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {18033#(<= main_~i~0 19)} assume true; {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,619 INFO L273 TraceCheckUtils]: 83: Hoare triple {18033#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,620 INFO L273 TraceCheckUtils]: 84: Hoare triple {18033#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:40,620 INFO L273 TraceCheckUtils]: 85: Hoare triple {18033#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,621 INFO L273 TraceCheckUtils]: 86: Hoare triple {18034#(<= main_~i~0 20)} assume true; {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,621 INFO L273 TraceCheckUtils]: 87: Hoare triple {18034#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,622 INFO L273 TraceCheckUtils]: 88: Hoare triple {18034#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:40,622 INFO L273 TraceCheckUtils]: 89: Hoare triple {18034#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,623 INFO L273 TraceCheckUtils]: 90: Hoare triple {18035#(<= main_~i~0 21)} assume true; {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,623 INFO L273 TraceCheckUtils]: 91: Hoare triple {18035#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,624 INFO L273 TraceCheckUtils]: 92: Hoare triple {18035#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:40,625 INFO L273 TraceCheckUtils]: 93: Hoare triple {18035#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,625 INFO L273 TraceCheckUtils]: 94: Hoare triple {18036#(<= main_~i~0 22)} assume true; {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,626 INFO L273 TraceCheckUtils]: 95: Hoare triple {18036#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,626 INFO L273 TraceCheckUtils]: 96: Hoare triple {18036#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:40,627 INFO L273 TraceCheckUtils]: 97: Hoare triple {18036#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,627 INFO L273 TraceCheckUtils]: 98: Hoare triple {18037#(<= main_~i~0 23)} assume true; {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,628 INFO L273 TraceCheckUtils]: 99: Hoare triple {18037#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,628 INFO L273 TraceCheckUtils]: 100: Hoare triple {18037#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:40,629 INFO L273 TraceCheckUtils]: 101: Hoare triple {18037#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,629 INFO L273 TraceCheckUtils]: 102: Hoare triple {18038#(<= main_~i~0 24)} assume true; {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,630 INFO L273 TraceCheckUtils]: 103: Hoare triple {18038#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,630 INFO L273 TraceCheckUtils]: 104: Hoare triple {18038#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:40,631 INFO L273 TraceCheckUtils]: 105: Hoare triple {18038#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,631 INFO L273 TraceCheckUtils]: 106: Hoare triple {18039#(<= main_~i~0 25)} assume true; {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,632 INFO L273 TraceCheckUtils]: 107: Hoare triple {18039#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,632 INFO L273 TraceCheckUtils]: 108: Hoare triple {18039#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:40,633 INFO L273 TraceCheckUtils]: 109: Hoare triple {18039#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,633 INFO L273 TraceCheckUtils]: 110: Hoare triple {18040#(<= main_~i~0 26)} assume true; {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,634 INFO L273 TraceCheckUtils]: 111: Hoare triple {18040#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,634 INFO L273 TraceCheckUtils]: 112: Hoare triple {18040#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:40,635 INFO L273 TraceCheckUtils]: 113: Hoare triple {18040#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,636 INFO L273 TraceCheckUtils]: 114: Hoare triple {18041#(<= main_~i~0 27)} assume true; {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,636 INFO L273 TraceCheckUtils]: 115: Hoare triple {18041#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,636 INFO L273 TraceCheckUtils]: 116: Hoare triple {18041#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:40,637 INFO L273 TraceCheckUtils]: 117: Hoare triple {18041#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18042#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,638 INFO L273 TraceCheckUtils]: 118: Hoare triple {18042#(<= main_~i~0 28)} assume true; {18042#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:40,638 INFO L273 TraceCheckUtils]: 119: Hoare triple {18042#(<= main_~i~0 28)} assume !(~i~0 < 100000); {18013#false} is VALID [2018-11-18 22:57:40,638 INFO L273 TraceCheckUtils]: 120: Hoare triple {18013#false} havoc ~x~0;~x~0 := 0; {18013#false} is VALID [2018-11-18 22:57:40,639 INFO L273 TraceCheckUtils]: 121: Hoare triple {18013#false} assume true; {18013#false} is VALID [2018-11-18 22:57:40,639 INFO L273 TraceCheckUtils]: 122: Hoare triple {18013#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {18013#false} is VALID [2018-11-18 22:57:40,639 INFO L256 TraceCheckUtils]: 123: Hoare triple {18013#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {18013#false} is VALID [2018-11-18 22:57:40,639 INFO L273 TraceCheckUtils]: 124: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2018-11-18 22:57:40,639 INFO L273 TraceCheckUtils]: 125: Hoare triple {18013#false} assume 0 == ~cond; {18013#false} is VALID [2018-11-18 22:57:40,640 INFO L273 TraceCheckUtils]: 126: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2018-11-18 22:57:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:40,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:40,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:40,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:57:42,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:57:42,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:42,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:42,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18012#true} is VALID [2018-11-18 22:57:42,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {18012#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18012#true} is VALID [2018-11-18 22:57:42,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2018-11-18 22:57:42,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #73#return; {18012#true} is VALID [2018-11-18 22:57:42,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret7 := main(); {18012#true} is VALID [2018-11-18 22:57:42,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {18012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {18061#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:42,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {18061#(<= main_~i~0 0)} assume true; {18061#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:42,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {18061#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18061#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:42,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {18061#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18061#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:42,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {18061#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:42,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {18015#(<= main_~i~0 1)} assume true; {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:42,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {18015#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:42,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {18015#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18015#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:42,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {18015#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:42,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {18016#(<= main_~i~0 2)} assume true; {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:42,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {18016#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:42,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {18016#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18016#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:42,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {18016#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:42,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {18017#(<= main_~i~0 3)} assume true; {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:42,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {18017#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:42,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {18017#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18017#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:42,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {18017#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:42,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {18018#(<= main_~i~0 4)} assume true; {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:42,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {18018#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:42,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {18018#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18018#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:42,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {18018#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:42,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {18019#(<= main_~i~0 5)} assume true; {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:42,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {18019#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:42,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {18019#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18019#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:42,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {18019#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:42,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {18020#(<= main_~i~0 6)} assume true; {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:42,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {18020#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:42,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {18020#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18020#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:42,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {18020#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:42,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {18021#(<= main_~i~0 7)} assume true; {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:42,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {18021#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:42,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {18021#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18021#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:42,718 INFO L273 TraceCheckUtils]: 37: Hoare triple {18021#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:42,718 INFO L273 TraceCheckUtils]: 38: Hoare triple {18022#(<= main_~i~0 8)} assume true; {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:42,719 INFO L273 TraceCheckUtils]: 39: Hoare triple {18022#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:42,719 INFO L273 TraceCheckUtils]: 40: Hoare triple {18022#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18022#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:42,720 INFO L273 TraceCheckUtils]: 41: Hoare triple {18022#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:42,721 INFO L273 TraceCheckUtils]: 42: Hoare triple {18023#(<= main_~i~0 9)} assume true; {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:42,721 INFO L273 TraceCheckUtils]: 43: Hoare triple {18023#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:42,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {18023#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18023#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:42,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {18023#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:42,723 INFO L273 TraceCheckUtils]: 46: Hoare triple {18024#(<= main_~i~0 10)} assume true; {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:42,723 INFO L273 TraceCheckUtils]: 47: Hoare triple {18024#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:42,724 INFO L273 TraceCheckUtils]: 48: Hoare triple {18024#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18024#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:42,725 INFO L273 TraceCheckUtils]: 49: Hoare triple {18024#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:42,725 INFO L273 TraceCheckUtils]: 50: Hoare triple {18025#(<= main_~i~0 11)} assume true; {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:42,726 INFO L273 TraceCheckUtils]: 51: Hoare triple {18025#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:42,726 INFO L273 TraceCheckUtils]: 52: Hoare triple {18025#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18025#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:42,727 INFO L273 TraceCheckUtils]: 53: Hoare triple {18025#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:42,727 INFO L273 TraceCheckUtils]: 54: Hoare triple {18026#(<= main_~i~0 12)} assume true; {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:42,728 INFO L273 TraceCheckUtils]: 55: Hoare triple {18026#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:42,728 INFO L273 TraceCheckUtils]: 56: Hoare triple {18026#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18026#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:42,729 INFO L273 TraceCheckUtils]: 57: Hoare triple {18026#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:42,730 INFO L273 TraceCheckUtils]: 58: Hoare triple {18027#(<= main_~i~0 13)} assume true; {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:42,730 INFO L273 TraceCheckUtils]: 59: Hoare triple {18027#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:42,731 INFO L273 TraceCheckUtils]: 60: Hoare triple {18027#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18027#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:42,731 INFO L273 TraceCheckUtils]: 61: Hoare triple {18027#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:42,732 INFO L273 TraceCheckUtils]: 62: Hoare triple {18028#(<= main_~i~0 14)} assume true; {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:42,732 INFO L273 TraceCheckUtils]: 63: Hoare triple {18028#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:42,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {18028#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18028#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:42,734 INFO L273 TraceCheckUtils]: 65: Hoare triple {18028#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:42,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {18029#(<= main_~i~0 15)} assume true; {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:42,735 INFO L273 TraceCheckUtils]: 67: Hoare triple {18029#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:42,735 INFO L273 TraceCheckUtils]: 68: Hoare triple {18029#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18029#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:42,736 INFO L273 TraceCheckUtils]: 69: Hoare triple {18029#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:42,736 INFO L273 TraceCheckUtils]: 70: Hoare triple {18030#(<= main_~i~0 16)} assume true; {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:42,737 INFO L273 TraceCheckUtils]: 71: Hoare triple {18030#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:42,737 INFO L273 TraceCheckUtils]: 72: Hoare triple {18030#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18030#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:42,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {18030#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:42,739 INFO L273 TraceCheckUtils]: 74: Hoare triple {18031#(<= main_~i~0 17)} assume true; {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:42,739 INFO L273 TraceCheckUtils]: 75: Hoare triple {18031#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:42,740 INFO L273 TraceCheckUtils]: 76: Hoare triple {18031#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18031#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:42,740 INFO L273 TraceCheckUtils]: 77: Hoare triple {18031#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:42,741 INFO L273 TraceCheckUtils]: 78: Hoare triple {18032#(<= main_~i~0 18)} assume true; {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:42,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {18032#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:42,742 INFO L273 TraceCheckUtils]: 80: Hoare triple {18032#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18032#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:42,742 INFO L273 TraceCheckUtils]: 81: Hoare triple {18032#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:42,743 INFO L273 TraceCheckUtils]: 82: Hoare triple {18033#(<= main_~i~0 19)} assume true; {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:42,744 INFO L273 TraceCheckUtils]: 83: Hoare triple {18033#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:42,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {18033#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18033#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:42,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {18033#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:42,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {18034#(<= main_~i~0 20)} assume true; {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:42,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {18034#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:42,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {18034#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18034#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:42,747 INFO L273 TraceCheckUtils]: 89: Hoare triple {18034#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:42,747 INFO L273 TraceCheckUtils]: 90: Hoare triple {18035#(<= main_~i~0 21)} assume true; {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:42,748 INFO L273 TraceCheckUtils]: 91: Hoare triple {18035#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:42,748 INFO L273 TraceCheckUtils]: 92: Hoare triple {18035#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18035#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:42,749 INFO L273 TraceCheckUtils]: 93: Hoare triple {18035#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:42,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {18036#(<= main_~i~0 22)} assume true; {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:42,750 INFO L273 TraceCheckUtils]: 95: Hoare triple {18036#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:42,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {18036#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18036#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:42,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {18036#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:42,752 INFO L273 TraceCheckUtils]: 98: Hoare triple {18037#(<= main_~i~0 23)} assume true; {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:42,752 INFO L273 TraceCheckUtils]: 99: Hoare triple {18037#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:42,753 INFO L273 TraceCheckUtils]: 100: Hoare triple {18037#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18037#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:42,754 INFO L273 TraceCheckUtils]: 101: Hoare triple {18037#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:42,754 INFO L273 TraceCheckUtils]: 102: Hoare triple {18038#(<= main_~i~0 24)} assume true; {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:42,755 INFO L273 TraceCheckUtils]: 103: Hoare triple {18038#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:42,755 INFO L273 TraceCheckUtils]: 104: Hoare triple {18038#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18038#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:42,756 INFO L273 TraceCheckUtils]: 105: Hoare triple {18038#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:42,756 INFO L273 TraceCheckUtils]: 106: Hoare triple {18039#(<= main_~i~0 25)} assume true; {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:42,757 INFO L273 TraceCheckUtils]: 107: Hoare triple {18039#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:42,757 INFO L273 TraceCheckUtils]: 108: Hoare triple {18039#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18039#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:42,758 INFO L273 TraceCheckUtils]: 109: Hoare triple {18039#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:42,759 INFO L273 TraceCheckUtils]: 110: Hoare triple {18040#(<= main_~i~0 26)} assume true; {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:42,759 INFO L273 TraceCheckUtils]: 111: Hoare triple {18040#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:42,781 INFO L273 TraceCheckUtils]: 112: Hoare triple {18040#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18040#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:42,795 INFO L273 TraceCheckUtils]: 113: Hoare triple {18040#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:42,803 INFO L273 TraceCheckUtils]: 114: Hoare triple {18041#(<= main_~i~0 27)} assume true; {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:42,806 INFO L273 TraceCheckUtils]: 115: Hoare triple {18041#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:42,806 INFO L273 TraceCheckUtils]: 116: Hoare triple {18041#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18041#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:42,806 INFO L273 TraceCheckUtils]: 117: Hoare triple {18041#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18042#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:42,807 INFO L273 TraceCheckUtils]: 118: Hoare triple {18042#(<= main_~i~0 28)} assume true; {18042#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:42,807 INFO L273 TraceCheckUtils]: 119: Hoare triple {18042#(<= main_~i~0 28)} assume !(~i~0 < 100000); {18013#false} is VALID [2018-11-18 22:57:42,807 INFO L273 TraceCheckUtils]: 120: Hoare triple {18013#false} havoc ~x~0;~x~0 := 0; {18013#false} is VALID [2018-11-18 22:57:42,807 INFO L273 TraceCheckUtils]: 121: Hoare triple {18013#false} assume true; {18013#false} is VALID [2018-11-18 22:57:42,808 INFO L273 TraceCheckUtils]: 122: Hoare triple {18013#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {18013#false} is VALID [2018-11-18 22:57:42,808 INFO L256 TraceCheckUtils]: 123: Hoare triple {18013#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {18013#false} is VALID [2018-11-18 22:57:42,808 INFO L273 TraceCheckUtils]: 124: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2018-11-18 22:57:42,808 INFO L273 TraceCheckUtils]: 125: Hoare triple {18013#false} assume 0 == ~cond; {18013#false} is VALID [2018-11-18 22:57:42,808 INFO L273 TraceCheckUtils]: 126: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2018-11-18 22:57:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:42,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:42,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-18 22:57:42,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-18 22:57:42,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:42,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-18 22:57:42,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:42,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 22:57:42,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 22:57:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:57:42,964 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand 32 states. [2018-11-18 22:57:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:43,792 INFO L93 Difference]: Finished difference Result 162 states and 198 transitions. [2018-11-18 22:57:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 22:57:43,792 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2018-11-18 22:57:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:57:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 198 transitions. [2018-11-18 22:57:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:57:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 198 transitions. [2018-11-18 22:57:43,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 198 transitions. [2018-11-18 22:57:43,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:43,973 INFO L225 Difference]: With dead ends: 162 [2018-11-18 22:57:43,973 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 22:57:43,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-18 22:57:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 22:57:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-11-18 22:57:44,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:44,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 142 states. [2018-11-18 22:57:44,021 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 142 states. [2018-11-18 22:57:44,021 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 142 states. [2018-11-18 22:57:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,025 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-18 22:57:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-11-18 22:57:44,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:44,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:44,026 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 144 states. [2018-11-18 22:57:44,026 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 144 states. [2018-11-18 22:57:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:44,028 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2018-11-18 22:57:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2018-11-18 22:57:44,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:44,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:44,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:44,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 22:57:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2018-11-18 22:57:44,032 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 127 [2018-11-18 22:57:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:44,032 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2018-11-18 22:57:44,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 22:57:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2018-11-18 22:57:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 22:57:44,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:44,033 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:44,033 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:44,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1992066285, now seen corresponding path program 29 times [2018-11-18 22:57:44,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:44,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:44,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {19099#true} call ULTIMATE.init(); {19099#true} is VALID [2018-11-18 22:57:44,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {19099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19099#true} is VALID [2018-11-18 22:57:44,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {19099#true} assume true; {19099#true} is VALID [2018-11-18 22:57:44,665 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19099#true} {19099#true} #73#return; {19099#true} is VALID [2018-11-18 22:57:44,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {19099#true} call #t~ret7 := main(); {19099#true} is VALID [2018-11-18 22:57:44,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {19099#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {19101#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {19101#(= main_~i~0 0)} assume true; {19101#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {19101#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19101#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {19101#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19101#(= main_~i~0 0)} is VALID [2018-11-18 22:57:44,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {19101#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {19102#(<= main_~i~0 1)} assume true; {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {19102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {19102#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:44,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {19102#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {19103#(<= main_~i~0 2)} assume true; {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {19103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {19103#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:44,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {19103#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {19104#(<= main_~i~0 3)} assume true; {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,671 INFO L273 TraceCheckUtils]: 19: Hoare triple {19104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {19104#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:44,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {19104#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {19105#(<= main_~i~0 4)} assume true; {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {19105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {19105#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:44,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {19105#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {19106#(<= main_~i~0 5)} assume true; {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {19106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,676 INFO L273 TraceCheckUtils]: 28: Hoare triple {19106#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:44,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {19106#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {19107#(<= main_~i~0 6)} assume true; {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,677 INFO L273 TraceCheckUtils]: 31: Hoare triple {19107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {19107#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:44,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {19107#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {19108#(<= main_~i~0 7)} assume true; {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {19108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {19108#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:44,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {19108#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,686 INFO L273 TraceCheckUtils]: 38: Hoare triple {19109#(<= main_~i~0 8)} assume true; {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {19109#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {19109#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:44,688 INFO L273 TraceCheckUtils]: 41: Hoare triple {19109#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,688 INFO L273 TraceCheckUtils]: 42: Hoare triple {19110#(<= main_~i~0 9)} assume true; {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {19110#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {19110#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:44,689 INFO L273 TraceCheckUtils]: 45: Hoare triple {19110#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {19111#(<= main_~i~0 10)} assume true; {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,690 INFO L273 TraceCheckUtils]: 47: Hoare triple {19111#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {19111#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:44,691 INFO L273 TraceCheckUtils]: 49: Hoare triple {19111#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,691 INFO L273 TraceCheckUtils]: 50: Hoare triple {19112#(<= main_~i~0 11)} assume true; {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,692 INFO L273 TraceCheckUtils]: 51: Hoare triple {19112#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,692 INFO L273 TraceCheckUtils]: 52: Hoare triple {19112#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:44,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {19112#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {19113#(<= main_~i~0 12)} assume true; {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,694 INFO L273 TraceCheckUtils]: 55: Hoare triple {19113#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,694 INFO L273 TraceCheckUtils]: 56: Hoare triple {19113#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:44,695 INFO L273 TraceCheckUtils]: 57: Hoare triple {19113#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {19114#(<= main_~i~0 13)} assume true; {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,696 INFO L273 TraceCheckUtils]: 59: Hoare triple {19114#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,697 INFO L273 TraceCheckUtils]: 60: Hoare triple {19114#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:44,697 INFO L273 TraceCheckUtils]: 61: Hoare triple {19114#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,698 INFO L273 TraceCheckUtils]: 62: Hoare triple {19115#(<= main_~i~0 14)} assume true; {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,698 INFO L273 TraceCheckUtils]: 63: Hoare triple {19115#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,699 INFO L273 TraceCheckUtils]: 64: Hoare triple {19115#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:44,699 INFO L273 TraceCheckUtils]: 65: Hoare triple {19115#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,700 INFO L273 TraceCheckUtils]: 66: Hoare triple {19116#(<= main_~i~0 15)} assume true; {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,700 INFO L273 TraceCheckUtils]: 67: Hoare triple {19116#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,701 INFO L273 TraceCheckUtils]: 68: Hoare triple {19116#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:44,701 INFO L273 TraceCheckUtils]: 69: Hoare triple {19116#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,702 INFO L273 TraceCheckUtils]: 70: Hoare triple {19117#(<= main_~i~0 16)} assume true; {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,702 INFO L273 TraceCheckUtils]: 71: Hoare triple {19117#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,703 INFO L273 TraceCheckUtils]: 72: Hoare triple {19117#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:44,704 INFO L273 TraceCheckUtils]: 73: Hoare triple {19117#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,704 INFO L273 TraceCheckUtils]: 74: Hoare triple {19118#(<= main_~i~0 17)} assume true; {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,705 INFO L273 TraceCheckUtils]: 75: Hoare triple {19118#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,705 INFO L273 TraceCheckUtils]: 76: Hoare triple {19118#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:44,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {19118#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {19119#(<= main_~i~0 18)} assume true; {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,707 INFO L273 TraceCheckUtils]: 79: Hoare triple {19119#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {19119#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:44,708 INFO L273 TraceCheckUtils]: 81: Hoare triple {19119#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,708 INFO L273 TraceCheckUtils]: 82: Hoare triple {19120#(<= main_~i~0 19)} assume true; {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,709 INFO L273 TraceCheckUtils]: 83: Hoare triple {19120#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,709 INFO L273 TraceCheckUtils]: 84: Hoare triple {19120#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:44,710 INFO L273 TraceCheckUtils]: 85: Hoare triple {19120#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,711 INFO L273 TraceCheckUtils]: 86: Hoare triple {19121#(<= main_~i~0 20)} assume true; {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,711 INFO L273 TraceCheckUtils]: 87: Hoare triple {19121#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,712 INFO L273 TraceCheckUtils]: 88: Hoare triple {19121#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:44,712 INFO L273 TraceCheckUtils]: 89: Hoare triple {19121#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,713 INFO L273 TraceCheckUtils]: 90: Hoare triple {19122#(<= main_~i~0 21)} assume true; {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,713 INFO L273 TraceCheckUtils]: 91: Hoare triple {19122#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,714 INFO L273 TraceCheckUtils]: 92: Hoare triple {19122#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:44,714 INFO L273 TraceCheckUtils]: 93: Hoare triple {19122#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,715 INFO L273 TraceCheckUtils]: 94: Hoare triple {19123#(<= main_~i~0 22)} assume true; {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,715 INFO L273 TraceCheckUtils]: 95: Hoare triple {19123#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,716 INFO L273 TraceCheckUtils]: 96: Hoare triple {19123#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:44,716 INFO L273 TraceCheckUtils]: 97: Hoare triple {19123#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,717 INFO L273 TraceCheckUtils]: 98: Hoare triple {19124#(<= main_~i~0 23)} assume true; {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,717 INFO L273 TraceCheckUtils]: 99: Hoare triple {19124#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,718 INFO L273 TraceCheckUtils]: 100: Hoare triple {19124#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:44,718 INFO L273 TraceCheckUtils]: 101: Hoare triple {19124#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,719 INFO L273 TraceCheckUtils]: 102: Hoare triple {19125#(<= main_~i~0 24)} assume true; {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,719 INFO L273 TraceCheckUtils]: 103: Hoare triple {19125#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,720 INFO L273 TraceCheckUtils]: 104: Hoare triple {19125#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:44,720 INFO L273 TraceCheckUtils]: 105: Hoare triple {19125#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,721 INFO L273 TraceCheckUtils]: 106: Hoare triple {19126#(<= main_~i~0 25)} assume true; {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,721 INFO L273 TraceCheckUtils]: 107: Hoare triple {19126#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {19126#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:44,723 INFO L273 TraceCheckUtils]: 109: Hoare triple {19126#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,723 INFO L273 TraceCheckUtils]: 110: Hoare triple {19127#(<= main_~i~0 26)} assume true; {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,724 INFO L273 TraceCheckUtils]: 111: Hoare triple {19127#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,724 INFO L273 TraceCheckUtils]: 112: Hoare triple {19127#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:44,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {19127#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {19128#(<= main_~i~0 27)} assume true; {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,726 INFO L273 TraceCheckUtils]: 115: Hoare triple {19128#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,746 INFO L273 TraceCheckUtils]: 116: Hoare triple {19128#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:44,758 INFO L273 TraceCheckUtils]: 117: Hoare triple {19128#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,759 INFO L273 TraceCheckUtils]: 118: Hoare triple {19129#(<= main_~i~0 28)} assume true; {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,759 INFO L273 TraceCheckUtils]: 119: Hoare triple {19129#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,760 INFO L273 TraceCheckUtils]: 120: Hoare triple {19129#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:44,760 INFO L273 TraceCheckUtils]: 121: Hoare triple {19129#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19130#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:44,760 INFO L273 TraceCheckUtils]: 122: Hoare triple {19130#(<= main_~i~0 29)} assume true; {19130#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:44,761 INFO L273 TraceCheckUtils]: 123: Hoare triple {19130#(<= main_~i~0 29)} assume !(~i~0 < 100000); {19100#false} is VALID [2018-11-18 22:57:44,761 INFO L273 TraceCheckUtils]: 124: Hoare triple {19100#false} havoc ~x~0;~x~0 := 0; {19100#false} is VALID [2018-11-18 22:57:44,761 INFO L273 TraceCheckUtils]: 125: Hoare triple {19100#false} assume true; {19100#false} is VALID [2018-11-18 22:57:44,761 INFO L273 TraceCheckUtils]: 126: Hoare triple {19100#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {19100#false} is VALID [2018-11-18 22:57:44,761 INFO L256 TraceCheckUtils]: 127: Hoare triple {19100#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {19100#false} is VALID [2018-11-18 22:57:44,761 INFO L273 TraceCheckUtils]: 128: Hoare triple {19100#false} ~cond := #in~cond; {19100#false} is VALID [2018-11-18 22:57:44,761 INFO L273 TraceCheckUtils]: 129: Hoare triple {19100#false} assume 0 == ~cond; {19100#false} is VALID [2018-11-18 22:57:44,762 INFO L273 TraceCheckUtils]: 130: Hoare triple {19100#false} assume !false; {19100#false} is VALID [2018-11-18 22:57:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:44,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:44,781 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:57:45,506 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-18 22:57:45,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:57:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:45,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:57:45,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {19099#true} call ULTIMATE.init(); {19099#true} is VALID [2018-11-18 22:57:45,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {19099#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19099#true} is VALID [2018-11-18 22:57:45,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {19099#true} assume true; {19099#true} is VALID [2018-11-18 22:57:45,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19099#true} {19099#true} #73#return; {19099#true} is VALID [2018-11-18 22:57:45,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {19099#true} call #t~ret7 := main(); {19099#true} is VALID [2018-11-18 22:57:45,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {19099#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {19149#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {19149#(<= main_~i~0 0)} assume true; {19149#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {19149#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19149#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {19149#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19149#(<= main_~i~0 0)} is VALID [2018-11-18 22:57:45,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {19149#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {19102#(<= main_~i~0 1)} assume true; {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {19102#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {19102#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19102#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:45,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {19102#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {19103#(<= main_~i~0 2)} assume true; {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {19103#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {19103#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19103#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:45,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {19103#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {19104#(<= main_~i~0 3)} assume true; {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {19104#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {19104#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19104#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:45,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {19104#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {19105#(<= main_~i~0 4)} assume true; {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {19105#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {19105#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19105#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:45,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {19105#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {19106#(<= main_~i~0 5)} assume true; {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {19106#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,782 INFO L273 TraceCheckUtils]: 28: Hoare triple {19106#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19106#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:45,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {19106#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {19107#(<= main_~i~0 6)} assume true; {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {19107#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {19107#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19107#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:45,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {19107#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {19108#(<= main_~i~0 7)} assume true; {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {19108#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {19108#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19108#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:45,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {19108#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {19109#(<= main_~i~0 8)} assume true; {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,788 INFO L273 TraceCheckUtils]: 39: Hoare triple {19109#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {19109#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19109#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:45,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {19109#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {19110#(<= main_~i~0 9)} assume true; {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,790 INFO L273 TraceCheckUtils]: 43: Hoare triple {19110#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {19110#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19110#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:45,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {19110#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {19111#(<= main_~i~0 10)} assume true; {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,793 INFO L273 TraceCheckUtils]: 47: Hoare triple {19111#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,793 INFO L273 TraceCheckUtils]: 48: Hoare triple {19111#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19111#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:45,794 INFO L273 TraceCheckUtils]: 49: Hoare triple {19111#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,794 INFO L273 TraceCheckUtils]: 50: Hoare triple {19112#(<= main_~i~0 11)} assume true; {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,795 INFO L273 TraceCheckUtils]: 51: Hoare triple {19112#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,795 INFO L273 TraceCheckUtils]: 52: Hoare triple {19112#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19112#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:45,796 INFO L273 TraceCheckUtils]: 53: Hoare triple {19112#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {19113#(<= main_~i~0 12)} assume true; {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,797 INFO L273 TraceCheckUtils]: 55: Hoare triple {19113#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,797 INFO L273 TraceCheckUtils]: 56: Hoare triple {19113#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19113#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:45,798 INFO L273 TraceCheckUtils]: 57: Hoare triple {19113#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,799 INFO L273 TraceCheckUtils]: 58: Hoare triple {19114#(<= main_~i~0 13)} assume true; {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {19114#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,799 INFO L273 TraceCheckUtils]: 60: Hoare triple {19114#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19114#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:45,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {19114#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,801 INFO L273 TraceCheckUtils]: 62: Hoare triple {19115#(<= main_~i~0 14)} assume true; {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,801 INFO L273 TraceCheckUtils]: 63: Hoare triple {19115#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,802 INFO L273 TraceCheckUtils]: 64: Hoare triple {19115#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19115#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:45,802 INFO L273 TraceCheckUtils]: 65: Hoare triple {19115#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,803 INFO L273 TraceCheckUtils]: 66: Hoare triple {19116#(<= main_~i~0 15)} assume true; {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,803 INFO L273 TraceCheckUtils]: 67: Hoare triple {19116#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,804 INFO L273 TraceCheckUtils]: 68: Hoare triple {19116#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19116#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:45,804 INFO L273 TraceCheckUtils]: 69: Hoare triple {19116#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,805 INFO L273 TraceCheckUtils]: 70: Hoare triple {19117#(<= main_~i~0 16)} assume true; {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,805 INFO L273 TraceCheckUtils]: 71: Hoare triple {19117#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,806 INFO L273 TraceCheckUtils]: 72: Hoare triple {19117#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19117#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:45,806 INFO L273 TraceCheckUtils]: 73: Hoare triple {19117#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,807 INFO L273 TraceCheckUtils]: 74: Hoare triple {19118#(<= main_~i~0 17)} assume true; {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,807 INFO L273 TraceCheckUtils]: 75: Hoare triple {19118#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,808 INFO L273 TraceCheckUtils]: 76: Hoare triple {19118#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19118#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:45,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {19118#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,809 INFO L273 TraceCheckUtils]: 78: Hoare triple {19119#(<= main_~i~0 18)} assume true; {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {19119#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {19119#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19119#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:45,811 INFO L273 TraceCheckUtils]: 81: Hoare triple {19119#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {19120#(<= main_~i~0 19)} assume true; {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,812 INFO L273 TraceCheckUtils]: 83: Hoare triple {19120#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,812 INFO L273 TraceCheckUtils]: 84: Hoare triple {19120#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19120#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:45,813 INFO L273 TraceCheckUtils]: 85: Hoare triple {19120#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,813 INFO L273 TraceCheckUtils]: 86: Hoare triple {19121#(<= main_~i~0 20)} assume true; {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,814 INFO L273 TraceCheckUtils]: 87: Hoare triple {19121#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,814 INFO L273 TraceCheckUtils]: 88: Hoare triple {19121#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19121#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:45,815 INFO L273 TraceCheckUtils]: 89: Hoare triple {19121#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,816 INFO L273 TraceCheckUtils]: 90: Hoare triple {19122#(<= main_~i~0 21)} assume true; {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,816 INFO L273 TraceCheckUtils]: 91: Hoare triple {19122#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,816 INFO L273 TraceCheckUtils]: 92: Hoare triple {19122#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19122#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:45,817 INFO L273 TraceCheckUtils]: 93: Hoare triple {19122#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,818 INFO L273 TraceCheckUtils]: 94: Hoare triple {19123#(<= main_~i~0 22)} assume true; {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,818 INFO L273 TraceCheckUtils]: 95: Hoare triple {19123#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,819 INFO L273 TraceCheckUtils]: 96: Hoare triple {19123#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19123#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:45,819 INFO L273 TraceCheckUtils]: 97: Hoare triple {19123#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,820 INFO L273 TraceCheckUtils]: 98: Hoare triple {19124#(<= main_~i~0 23)} assume true; {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,820 INFO L273 TraceCheckUtils]: 99: Hoare triple {19124#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,821 INFO L273 TraceCheckUtils]: 100: Hoare triple {19124#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19124#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:45,822 INFO L273 TraceCheckUtils]: 101: Hoare triple {19124#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {19125#(<= main_~i~0 24)} assume true; {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,823 INFO L273 TraceCheckUtils]: 103: Hoare triple {19125#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,823 INFO L273 TraceCheckUtils]: 104: Hoare triple {19125#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19125#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:45,824 INFO L273 TraceCheckUtils]: 105: Hoare triple {19125#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {19126#(<= main_~i~0 25)} assume true; {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,825 INFO L273 TraceCheckUtils]: 107: Hoare triple {19126#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,825 INFO L273 TraceCheckUtils]: 108: Hoare triple {19126#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19126#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:45,826 INFO L273 TraceCheckUtils]: 109: Hoare triple {19126#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,827 INFO L273 TraceCheckUtils]: 110: Hoare triple {19127#(<= main_~i~0 26)} assume true; {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {19127#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,827 INFO L273 TraceCheckUtils]: 112: Hoare triple {19127#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19127#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:45,828 INFO L273 TraceCheckUtils]: 113: Hoare triple {19127#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,829 INFO L273 TraceCheckUtils]: 114: Hoare triple {19128#(<= main_~i~0 27)} assume true; {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,829 INFO L273 TraceCheckUtils]: 115: Hoare triple {19128#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,830 INFO L273 TraceCheckUtils]: 116: Hoare triple {19128#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19128#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:45,830 INFO L273 TraceCheckUtils]: 117: Hoare triple {19128#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,831 INFO L273 TraceCheckUtils]: 118: Hoare triple {19129#(<= main_~i~0 28)} assume true; {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,831 INFO L273 TraceCheckUtils]: 119: Hoare triple {19129#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,832 INFO L273 TraceCheckUtils]: 120: Hoare triple {19129#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19129#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:45,832 INFO L273 TraceCheckUtils]: 121: Hoare triple {19129#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19130#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:45,833 INFO L273 TraceCheckUtils]: 122: Hoare triple {19130#(<= main_~i~0 29)} assume true; {19130#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:45,833 INFO L273 TraceCheckUtils]: 123: Hoare triple {19130#(<= main_~i~0 29)} assume !(~i~0 < 100000); {19100#false} is VALID [2018-11-18 22:57:45,834 INFO L273 TraceCheckUtils]: 124: Hoare triple {19100#false} havoc ~x~0;~x~0 := 0; {19100#false} is VALID [2018-11-18 22:57:45,834 INFO L273 TraceCheckUtils]: 125: Hoare triple {19100#false} assume true; {19100#false} is VALID [2018-11-18 22:57:45,834 INFO L273 TraceCheckUtils]: 126: Hoare triple {19100#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {19100#false} is VALID [2018-11-18 22:57:45,834 INFO L256 TraceCheckUtils]: 127: Hoare triple {19100#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {19100#false} is VALID [2018-11-18 22:57:45,834 INFO L273 TraceCheckUtils]: 128: Hoare triple {19100#false} ~cond := #in~cond; {19100#false} is VALID [2018-11-18 22:57:45,834 INFO L273 TraceCheckUtils]: 129: Hoare triple {19100#false} assume 0 == ~cond; {19100#false} is VALID [2018-11-18 22:57:45,835 INFO L273 TraceCheckUtils]: 130: Hoare triple {19100#false} assume !false; {19100#false} is VALID [2018-11-18 22:57:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:57:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-18 22:57:45,866 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-18 22:57:45,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:57:45,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-18 22:57:45,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:45,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-18 22:57:45,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 22:57:45,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:57:45,991 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand 33 states. [2018-11-18 22:57:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:47,290 INFO L93 Difference]: Finished difference Result 166 states and 203 transitions. [2018-11-18 22:57:47,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 22:57:47,290 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 131 [2018-11-18 22:57:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:57:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:57:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-18 22:57:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:57:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 203 transitions. [2018-11-18 22:57:47,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 203 transitions. [2018-11-18 22:57:47,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:57:47,500 INFO L225 Difference]: With dead ends: 166 [2018-11-18 22:57:47,500 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 22:57:47,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 22:57:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 22:57:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-18 22:57:47,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:57:47,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-18 22:57:47,560 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-18 22:57:47,560 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-18 22:57:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:47,563 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2018-11-18 22:57:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2018-11-18 22:57:47,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:47,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:47,563 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-18 22:57:47,563 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-18 22:57:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:57:47,566 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2018-11-18 22:57:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2018-11-18 22:57:47,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:57:47,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:57:47,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:57:47,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:57:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 22:57:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2018-11-18 22:57:47,568 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 131 [2018-11-18 22:57:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:57:47,569 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2018-11-18 22:57:47,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-18 22:57:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2018-11-18 22:57:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 22:57:47,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:57:47,569 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:57:47,570 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:57:47,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:57:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1356531324, now seen corresponding path program 30 times [2018-11-18 22:57:47,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:57:47,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:57:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:47,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:57:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:57:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:57:49,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {20217#true} call ULTIMATE.init(); {20217#true} is VALID [2018-11-18 22:57:49,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {20217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20217#true} is VALID [2018-11-18 22:57:49,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {20217#true} assume true; {20217#true} is VALID [2018-11-18 22:57:49,557 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20217#true} {20217#true} #73#return; {20217#true} is VALID [2018-11-18 22:57:49,557 INFO L256 TraceCheckUtils]: 4: Hoare triple {20217#true} call #t~ret7 := main(); {20217#true} is VALID [2018-11-18 22:57:49,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {20217#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {20219#(= main_~i~0 0)} is VALID [2018-11-18 22:57:49,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {20219#(= main_~i~0 0)} assume true; {20219#(= main_~i~0 0)} is VALID [2018-11-18 22:57:49,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {20219#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20219#(= main_~i~0 0)} is VALID [2018-11-18 22:57:49,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {20219#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20219#(= main_~i~0 0)} is VALID [2018-11-18 22:57:49,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {20219#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:49,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {20220#(<= main_~i~0 1)} assume true; {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:49,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {20220#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:49,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {20220#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:57:49,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {20220#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:49,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {20221#(<= main_~i~0 2)} assume true; {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:49,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {20221#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:49,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {20221#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:57:49,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {20221#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:49,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {20222#(<= main_~i~0 3)} assume true; {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:49,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {20222#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:49,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {20222#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:57:49,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {20222#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:49,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {20223#(<= main_~i~0 4)} assume true; {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:49,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {20223#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:49,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {20223#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:57:49,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {20223#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:49,568 INFO L273 TraceCheckUtils]: 26: Hoare triple {20224#(<= main_~i~0 5)} assume true; {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:49,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {20224#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:49,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {20224#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:57:49,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {20224#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:49,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {20225#(<= main_~i~0 6)} assume true; {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:49,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {20225#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:49,572 INFO L273 TraceCheckUtils]: 32: Hoare triple {20225#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:57:49,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {20225#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:49,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {20226#(<= main_~i~0 7)} assume true; {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:49,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {20226#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:49,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {20226#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:57:49,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {20226#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:49,575 INFO L273 TraceCheckUtils]: 38: Hoare triple {20227#(<= main_~i~0 8)} assume true; {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:49,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {20227#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:49,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {20227#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:57:49,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {20227#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:49,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {20228#(<= main_~i~0 9)} assume true; {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:49,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {20228#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:49,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {20228#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:57:49,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {20228#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:49,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {20229#(<= main_~i~0 10)} assume true; {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:49,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {20229#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:49,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {20229#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:57:49,581 INFO L273 TraceCheckUtils]: 49: Hoare triple {20229#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:49,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {20230#(<= main_~i~0 11)} assume true; {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:49,582 INFO L273 TraceCheckUtils]: 51: Hoare triple {20230#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:49,583 INFO L273 TraceCheckUtils]: 52: Hoare triple {20230#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:57:49,583 INFO L273 TraceCheckUtils]: 53: Hoare triple {20230#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:49,584 INFO L273 TraceCheckUtils]: 54: Hoare triple {20231#(<= main_~i~0 12)} assume true; {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:49,585 INFO L273 TraceCheckUtils]: 55: Hoare triple {20231#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:49,585 INFO L273 TraceCheckUtils]: 56: Hoare triple {20231#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:57:49,586 INFO L273 TraceCheckUtils]: 57: Hoare triple {20231#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:49,586 INFO L273 TraceCheckUtils]: 58: Hoare triple {20232#(<= main_~i~0 13)} assume true; {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:49,587 INFO L273 TraceCheckUtils]: 59: Hoare triple {20232#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:49,587 INFO L273 TraceCheckUtils]: 60: Hoare triple {20232#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:57:49,588 INFO L273 TraceCheckUtils]: 61: Hoare triple {20232#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:49,588 INFO L273 TraceCheckUtils]: 62: Hoare triple {20233#(<= main_~i~0 14)} assume true; {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:49,589 INFO L273 TraceCheckUtils]: 63: Hoare triple {20233#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:49,589 INFO L273 TraceCheckUtils]: 64: Hoare triple {20233#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:57:49,590 INFO L273 TraceCheckUtils]: 65: Hoare triple {20233#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:49,590 INFO L273 TraceCheckUtils]: 66: Hoare triple {20234#(<= main_~i~0 15)} assume true; {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:49,591 INFO L273 TraceCheckUtils]: 67: Hoare triple {20234#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:49,591 INFO L273 TraceCheckUtils]: 68: Hoare triple {20234#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:57:49,592 INFO L273 TraceCheckUtils]: 69: Hoare triple {20234#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:49,593 INFO L273 TraceCheckUtils]: 70: Hoare triple {20235#(<= main_~i~0 16)} assume true; {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:49,593 INFO L273 TraceCheckUtils]: 71: Hoare triple {20235#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:49,594 INFO L273 TraceCheckUtils]: 72: Hoare triple {20235#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:57:49,594 INFO L273 TraceCheckUtils]: 73: Hoare triple {20235#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:49,595 INFO L273 TraceCheckUtils]: 74: Hoare triple {20236#(<= main_~i~0 17)} assume true; {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:49,595 INFO L273 TraceCheckUtils]: 75: Hoare triple {20236#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:49,596 INFO L273 TraceCheckUtils]: 76: Hoare triple {20236#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:57:49,596 INFO L273 TraceCheckUtils]: 77: Hoare triple {20236#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:49,597 INFO L273 TraceCheckUtils]: 78: Hoare triple {20237#(<= main_~i~0 18)} assume true; {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:49,597 INFO L273 TraceCheckUtils]: 79: Hoare triple {20237#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:49,598 INFO L273 TraceCheckUtils]: 80: Hoare triple {20237#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:57:49,598 INFO L273 TraceCheckUtils]: 81: Hoare triple {20237#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:49,599 INFO L273 TraceCheckUtils]: 82: Hoare triple {20238#(<= main_~i~0 19)} assume true; {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:49,599 INFO L273 TraceCheckUtils]: 83: Hoare triple {20238#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:49,600 INFO L273 TraceCheckUtils]: 84: Hoare triple {20238#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:57:49,600 INFO L273 TraceCheckUtils]: 85: Hoare triple {20238#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:49,601 INFO L273 TraceCheckUtils]: 86: Hoare triple {20239#(<= main_~i~0 20)} assume true; {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:49,602 INFO L273 TraceCheckUtils]: 87: Hoare triple {20239#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:49,602 INFO L273 TraceCheckUtils]: 88: Hoare triple {20239#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:57:49,603 INFO L273 TraceCheckUtils]: 89: Hoare triple {20239#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:49,603 INFO L273 TraceCheckUtils]: 90: Hoare triple {20240#(<= main_~i~0 21)} assume true; {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:49,604 INFO L273 TraceCheckUtils]: 91: Hoare triple {20240#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:49,604 INFO L273 TraceCheckUtils]: 92: Hoare triple {20240#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:57:49,605 INFO L273 TraceCheckUtils]: 93: Hoare triple {20240#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:49,605 INFO L273 TraceCheckUtils]: 94: Hoare triple {20241#(<= main_~i~0 22)} assume true; {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:49,606 INFO L273 TraceCheckUtils]: 95: Hoare triple {20241#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:49,606 INFO L273 TraceCheckUtils]: 96: Hoare triple {20241#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:57:49,607 INFO L273 TraceCheckUtils]: 97: Hoare triple {20241#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:49,607 INFO L273 TraceCheckUtils]: 98: Hoare triple {20242#(<= main_~i~0 23)} assume true; {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:49,608 INFO L273 TraceCheckUtils]: 99: Hoare triple {20242#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:49,608 INFO L273 TraceCheckUtils]: 100: Hoare triple {20242#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:57:49,609 INFO L273 TraceCheckUtils]: 101: Hoare triple {20242#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:49,609 INFO L273 TraceCheckUtils]: 102: Hoare triple {20243#(<= main_~i~0 24)} assume true; {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:49,610 INFO L273 TraceCheckUtils]: 103: Hoare triple {20243#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:49,610 INFO L273 TraceCheckUtils]: 104: Hoare triple {20243#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:57:49,611 INFO L273 TraceCheckUtils]: 105: Hoare triple {20243#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:49,612 INFO L273 TraceCheckUtils]: 106: Hoare triple {20244#(<= main_~i~0 25)} assume true; {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:49,612 INFO L273 TraceCheckUtils]: 107: Hoare triple {20244#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:49,612 INFO L273 TraceCheckUtils]: 108: Hoare triple {20244#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:57:49,613 INFO L273 TraceCheckUtils]: 109: Hoare triple {20244#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:49,614 INFO L273 TraceCheckUtils]: 110: Hoare triple {20245#(<= main_~i~0 26)} assume true; {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:49,614 INFO L273 TraceCheckUtils]: 111: Hoare triple {20245#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:49,615 INFO L273 TraceCheckUtils]: 112: Hoare triple {20245#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:57:49,615 INFO L273 TraceCheckUtils]: 113: Hoare triple {20245#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:49,616 INFO L273 TraceCheckUtils]: 114: Hoare triple {20246#(<= main_~i~0 27)} assume true; {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:49,616 INFO L273 TraceCheckUtils]: 115: Hoare triple {20246#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:49,617 INFO L273 TraceCheckUtils]: 116: Hoare triple {20246#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:57:49,617 INFO L273 TraceCheckUtils]: 117: Hoare triple {20246#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:49,618 INFO L273 TraceCheckUtils]: 118: Hoare triple {20247#(<= main_~i~0 28)} assume true; {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:49,618 INFO L273 TraceCheckUtils]: 119: Hoare triple {20247#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:49,619 INFO L273 TraceCheckUtils]: 120: Hoare triple {20247#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:57:49,619 INFO L273 TraceCheckUtils]: 121: Hoare triple {20247#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:49,620 INFO L273 TraceCheckUtils]: 122: Hoare triple {20248#(<= main_~i~0 29)} assume true; {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:49,620 INFO L273 TraceCheckUtils]: 123: Hoare triple {20248#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:49,621 INFO L273 TraceCheckUtils]: 124: Hoare triple {20248#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:57:49,622 INFO L273 TraceCheckUtils]: 125: Hoare triple {20248#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20249#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:49,622 INFO L273 TraceCheckUtils]: 126: Hoare triple {20249#(<= main_~i~0 30)} assume true; {20249#(<= main_~i~0 30)} is VALID [2018-11-18 22:57:49,623 INFO L273 TraceCheckUtils]: 127: Hoare triple {20249#(<= main_~i~0 30)} assume !(~i~0 < 100000); {20218#false} is VALID [2018-11-18 22:57:49,623 INFO L273 TraceCheckUtils]: 128: Hoare triple {20218#false} havoc ~x~0;~x~0 := 0; {20218#false} is VALID [2018-11-18 22:57:49,623 INFO L273 TraceCheckUtils]: 129: Hoare triple {20218#false} assume true; {20218#false} is VALID [2018-11-18 22:57:49,623 INFO L273 TraceCheckUtils]: 130: Hoare triple {20218#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {20218#false} is VALID [2018-11-18 22:57:49,623 INFO L256 TraceCheckUtils]: 131: Hoare triple {20218#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {20218#false} is VALID [2018-11-18 22:57:49,624 INFO L273 TraceCheckUtils]: 132: Hoare triple {20218#false} ~cond := #in~cond; {20218#false} is VALID [2018-11-18 22:57:49,624 INFO L273 TraceCheckUtils]: 133: Hoare triple {20218#false} assume 0 == ~cond; {20218#false} is VALID [2018-11-18 22:57:49,624 INFO L273 TraceCheckUtils]: 134: Hoare triple {20218#false} assume !false; {20218#false} is VALID [2018-11-18 22:57:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:57:49,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:57:49,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:57:49,644 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:58:02,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-18 22:58:02,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:02,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:02,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {20217#true} call ULTIMATE.init(); {20217#true} is VALID [2018-11-18 22:58:02,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {20217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20217#true} is VALID [2018-11-18 22:58:02,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {20217#true} assume true; {20217#true} is VALID [2018-11-18 22:58:02,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20217#true} {20217#true} #73#return; {20217#true} is VALID [2018-11-18 22:58:02,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {20217#true} call #t~ret7 := main(); {20217#true} is VALID [2018-11-18 22:58:02,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {20217#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {20268#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {20268#(<= main_~i~0 0)} assume true; {20268#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {20268#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20268#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {20268#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20268#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:02,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {20268#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {20220#(<= main_~i~0 1)} assume true; {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {20220#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {20220#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20220#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:02,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {20220#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {20221#(<= main_~i~0 2)} assume true; {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {20221#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {20221#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20221#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:02,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {20221#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {20222#(<= main_~i~0 3)} assume true; {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {20222#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {20222#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20222#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:02,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {20222#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,876 INFO L273 TraceCheckUtils]: 22: Hoare triple {20223#(<= main_~i~0 4)} assume true; {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,876 INFO L273 TraceCheckUtils]: 23: Hoare triple {20223#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {20223#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20223#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:02,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {20223#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {20224#(<= main_~i~0 5)} assume true; {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {20224#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {20224#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20224#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:02,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {20224#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {20225#(<= main_~i~0 6)} assume true; {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {20225#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {20225#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20225#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:02,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {20225#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {20226#(<= main_~i~0 7)} assume true; {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {20226#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {20226#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20226#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:02,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {20226#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {20227#(<= main_~i~0 8)} assume true; {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {20227#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,886 INFO L273 TraceCheckUtils]: 40: Hoare triple {20227#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20227#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:02,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {20227#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {20228#(<= main_~i~0 9)} assume true; {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {20228#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {20228#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20228#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:02,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {20228#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {20229#(<= main_~i~0 10)} assume true; {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {20229#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {20229#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20229#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:02,891 INFO L273 TraceCheckUtils]: 49: Hoare triple {20229#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,891 INFO L273 TraceCheckUtils]: 50: Hoare triple {20230#(<= main_~i~0 11)} assume true; {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {20230#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {20230#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20230#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:02,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {20230#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,894 INFO L273 TraceCheckUtils]: 54: Hoare triple {20231#(<= main_~i~0 12)} assume true; {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {20231#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,895 INFO L273 TraceCheckUtils]: 56: Hoare triple {20231#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20231#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:02,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {20231#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {20232#(<= main_~i~0 13)} assume true; {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {20232#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,897 INFO L273 TraceCheckUtils]: 60: Hoare triple {20232#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20232#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:02,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {20232#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,898 INFO L273 TraceCheckUtils]: 62: Hoare triple {20233#(<= main_~i~0 14)} assume true; {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {20233#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {20233#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20233#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:02,900 INFO L273 TraceCheckUtils]: 65: Hoare triple {20233#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {20234#(<= main_~i~0 15)} assume true; {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,901 INFO L273 TraceCheckUtils]: 67: Hoare triple {20234#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {20234#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20234#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:02,902 INFO L273 TraceCheckUtils]: 69: Hoare triple {20234#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,903 INFO L273 TraceCheckUtils]: 70: Hoare triple {20235#(<= main_~i~0 16)} assume true; {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,903 INFO L273 TraceCheckUtils]: 71: Hoare triple {20235#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,904 INFO L273 TraceCheckUtils]: 72: Hoare triple {20235#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20235#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:02,904 INFO L273 TraceCheckUtils]: 73: Hoare triple {20235#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,905 INFO L273 TraceCheckUtils]: 74: Hoare triple {20236#(<= main_~i~0 17)} assume true; {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,905 INFO L273 TraceCheckUtils]: 75: Hoare triple {20236#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,906 INFO L273 TraceCheckUtils]: 76: Hoare triple {20236#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20236#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:02,907 INFO L273 TraceCheckUtils]: 77: Hoare triple {20236#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,907 INFO L273 TraceCheckUtils]: 78: Hoare triple {20237#(<= main_~i~0 18)} assume true; {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,908 INFO L273 TraceCheckUtils]: 79: Hoare triple {20237#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,908 INFO L273 TraceCheckUtils]: 80: Hoare triple {20237#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20237#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:02,909 INFO L273 TraceCheckUtils]: 81: Hoare triple {20237#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,909 INFO L273 TraceCheckUtils]: 82: Hoare triple {20238#(<= main_~i~0 19)} assume true; {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,910 INFO L273 TraceCheckUtils]: 83: Hoare triple {20238#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,910 INFO L273 TraceCheckUtils]: 84: Hoare triple {20238#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20238#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:02,911 INFO L273 TraceCheckUtils]: 85: Hoare triple {20238#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,912 INFO L273 TraceCheckUtils]: 86: Hoare triple {20239#(<= main_~i~0 20)} assume true; {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,912 INFO L273 TraceCheckUtils]: 87: Hoare triple {20239#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,913 INFO L273 TraceCheckUtils]: 88: Hoare triple {20239#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20239#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:02,913 INFO L273 TraceCheckUtils]: 89: Hoare triple {20239#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,914 INFO L273 TraceCheckUtils]: 90: Hoare triple {20240#(<= main_~i~0 21)} assume true; {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,914 INFO L273 TraceCheckUtils]: 91: Hoare triple {20240#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,915 INFO L273 TraceCheckUtils]: 92: Hoare triple {20240#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20240#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:02,915 INFO L273 TraceCheckUtils]: 93: Hoare triple {20240#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,916 INFO L273 TraceCheckUtils]: 94: Hoare triple {20241#(<= main_~i~0 22)} assume true; {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,916 INFO L273 TraceCheckUtils]: 95: Hoare triple {20241#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,917 INFO L273 TraceCheckUtils]: 96: Hoare triple {20241#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20241#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:02,918 INFO L273 TraceCheckUtils]: 97: Hoare triple {20241#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,918 INFO L273 TraceCheckUtils]: 98: Hoare triple {20242#(<= main_~i~0 23)} assume true; {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,919 INFO L273 TraceCheckUtils]: 99: Hoare triple {20242#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,919 INFO L273 TraceCheckUtils]: 100: Hoare triple {20242#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20242#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:02,920 INFO L273 TraceCheckUtils]: 101: Hoare triple {20242#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,920 INFO L273 TraceCheckUtils]: 102: Hoare triple {20243#(<= main_~i~0 24)} assume true; {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,921 INFO L273 TraceCheckUtils]: 103: Hoare triple {20243#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,921 INFO L273 TraceCheckUtils]: 104: Hoare triple {20243#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20243#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:02,922 INFO L273 TraceCheckUtils]: 105: Hoare triple {20243#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,923 INFO L273 TraceCheckUtils]: 106: Hoare triple {20244#(<= main_~i~0 25)} assume true; {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,923 INFO L273 TraceCheckUtils]: 107: Hoare triple {20244#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,924 INFO L273 TraceCheckUtils]: 108: Hoare triple {20244#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20244#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:02,924 INFO L273 TraceCheckUtils]: 109: Hoare triple {20244#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,925 INFO L273 TraceCheckUtils]: 110: Hoare triple {20245#(<= main_~i~0 26)} assume true; {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,925 INFO L273 TraceCheckUtils]: 111: Hoare triple {20245#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,926 INFO L273 TraceCheckUtils]: 112: Hoare triple {20245#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20245#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:02,927 INFO L273 TraceCheckUtils]: 113: Hoare triple {20245#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,927 INFO L273 TraceCheckUtils]: 114: Hoare triple {20246#(<= main_~i~0 27)} assume true; {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,928 INFO L273 TraceCheckUtils]: 115: Hoare triple {20246#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,928 INFO L273 TraceCheckUtils]: 116: Hoare triple {20246#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20246#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:02,929 INFO L273 TraceCheckUtils]: 117: Hoare triple {20246#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,929 INFO L273 TraceCheckUtils]: 118: Hoare triple {20247#(<= main_~i~0 28)} assume true; {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,930 INFO L273 TraceCheckUtils]: 119: Hoare triple {20247#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,930 INFO L273 TraceCheckUtils]: 120: Hoare triple {20247#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20247#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:02,931 INFO L273 TraceCheckUtils]: 121: Hoare triple {20247#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,932 INFO L273 TraceCheckUtils]: 122: Hoare triple {20248#(<= main_~i~0 29)} assume true; {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,932 INFO L273 TraceCheckUtils]: 123: Hoare triple {20248#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,933 INFO L273 TraceCheckUtils]: 124: Hoare triple {20248#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20248#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:02,933 INFO L273 TraceCheckUtils]: 125: Hoare triple {20248#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20249#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:02,934 INFO L273 TraceCheckUtils]: 126: Hoare triple {20249#(<= main_~i~0 30)} assume true; {20249#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:02,934 INFO L273 TraceCheckUtils]: 127: Hoare triple {20249#(<= main_~i~0 30)} assume !(~i~0 < 100000); {20218#false} is VALID [2018-11-18 22:58:02,935 INFO L273 TraceCheckUtils]: 128: Hoare triple {20218#false} havoc ~x~0;~x~0 := 0; {20218#false} is VALID [2018-11-18 22:58:02,935 INFO L273 TraceCheckUtils]: 129: Hoare triple {20218#false} assume true; {20218#false} is VALID [2018-11-18 22:58:02,935 INFO L273 TraceCheckUtils]: 130: Hoare triple {20218#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {20218#false} is VALID [2018-11-18 22:58:02,935 INFO L256 TraceCheckUtils]: 131: Hoare triple {20218#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {20218#false} is VALID [2018-11-18 22:58:02,935 INFO L273 TraceCheckUtils]: 132: Hoare triple {20218#false} ~cond := #in~cond; {20218#false} is VALID [2018-11-18 22:58:02,936 INFO L273 TraceCheckUtils]: 133: Hoare triple {20218#false} assume 0 == ~cond; {20218#false} is VALID [2018-11-18 22:58:02,936 INFO L273 TraceCheckUtils]: 134: Hoare triple {20218#false} assume !false; {20218#false} is VALID [2018-11-18 22:58:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:02,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-18 22:58:02,971 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-11-18 22:58:02,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:02,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-18 22:58:03,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:03,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 22:58:03,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 22:58:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:58:03,157 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand 34 states. [2018-11-18 22:58:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:04,004 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2018-11-18 22:58:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 22:58:04,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-11-18 22:58:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:58:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 208 transitions. [2018-11-18 22:58:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:58:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 208 transitions. [2018-11-18 22:58:04,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 208 transitions. [2018-11-18 22:58:04,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:04,221 INFO L225 Difference]: With dead ends: 170 [2018-11-18 22:58:04,221 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 22:58:04,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 22:58:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 22:58:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-18 22:58:04,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:04,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2018-11-18 22:58:04,560 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2018-11-18 22:58:04,560 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2018-11-18 22:58:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:04,562 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2018-11-18 22:58:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2018-11-18 22:58:04,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:04,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:04,563 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2018-11-18 22:58:04,563 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2018-11-18 22:58:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:04,565 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2018-11-18 22:58:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2018-11-18 22:58:04,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:04,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:04,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:04,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 22:58:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2018-11-18 22:58:04,569 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 135 [2018-11-18 22:58:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:04,570 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2018-11-18 22:58:04,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 22:58:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2018-11-18 22:58:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 22:58:04,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:04,571 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:04,571 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:04,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash -561821029, now seen corresponding path program 31 times [2018-11-18 22:58:04,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:04,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:04,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:05,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {21366#true} call ULTIMATE.init(); {21366#true} is VALID [2018-11-18 22:58:05,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {21366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21366#true} is VALID [2018-11-18 22:58:05,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {21366#true} assume true; {21366#true} is VALID [2018-11-18 22:58:05,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21366#true} {21366#true} #73#return; {21366#true} is VALID [2018-11-18 22:58:05,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {21366#true} call #t~ret7 := main(); {21366#true} is VALID [2018-11-18 22:58:05,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {21366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {21368#(= main_~i~0 0)} is VALID [2018-11-18 22:58:05,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {21368#(= main_~i~0 0)} assume true; {21368#(= main_~i~0 0)} is VALID [2018-11-18 22:58:05,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {21368#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21368#(= main_~i~0 0)} is VALID [2018-11-18 22:58:05,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {21368#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21368#(= main_~i~0 0)} is VALID [2018-11-18 22:58:05,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {21368#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {21369#(<= main_~i~0 1)} assume true; {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {21369#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {21369#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {21369#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {21370#(<= main_~i~0 2)} assume true; {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {21370#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {21370#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {21370#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {21371#(<= main_~i~0 3)} assume true; {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {21371#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {21371#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {21371#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {21372#(<= main_~i~0 4)} assume true; {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {21372#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {21372#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {21372#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {21373#(<= main_~i~0 5)} assume true; {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {21373#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {21373#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {21373#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,352 INFO L273 TraceCheckUtils]: 30: Hoare triple {21374#(<= main_~i~0 6)} assume true; {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,352 INFO L273 TraceCheckUtils]: 31: Hoare triple {21374#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {21374#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {21374#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {21375#(<= main_~i~0 7)} assume true; {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {21375#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {21375#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {21375#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {21376#(<= main_~i~0 8)} assume true; {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {21376#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {21376#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,357 INFO L273 TraceCheckUtils]: 41: Hoare triple {21376#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {21377#(<= main_~i~0 9)} assume true; {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,358 INFO L273 TraceCheckUtils]: 43: Hoare triple {21377#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {21377#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,359 INFO L273 TraceCheckUtils]: 45: Hoare triple {21377#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {21378#(<= main_~i~0 10)} assume true; {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,360 INFO L273 TraceCheckUtils]: 47: Hoare triple {21378#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {21378#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,362 INFO L273 TraceCheckUtils]: 49: Hoare triple {21378#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {21379#(<= main_~i~0 11)} assume true; {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,362 INFO L273 TraceCheckUtils]: 51: Hoare triple {21379#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {21379#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {21379#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,364 INFO L273 TraceCheckUtils]: 54: Hoare triple {21380#(<= main_~i~0 12)} assume true; {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {21380#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {21380#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {21380#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,366 INFO L273 TraceCheckUtils]: 58: Hoare triple {21381#(<= main_~i~0 13)} assume true; {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,367 INFO L273 TraceCheckUtils]: 59: Hoare triple {21381#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,367 INFO L273 TraceCheckUtils]: 60: Hoare triple {21381#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,368 INFO L273 TraceCheckUtils]: 61: Hoare triple {21381#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,368 INFO L273 TraceCheckUtils]: 62: Hoare triple {21382#(<= main_~i~0 14)} assume true; {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,369 INFO L273 TraceCheckUtils]: 63: Hoare triple {21382#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,369 INFO L273 TraceCheckUtils]: 64: Hoare triple {21382#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,370 INFO L273 TraceCheckUtils]: 65: Hoare triple {21382#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,370 INFO L273 TraceCheckUtils]: 66: Hoare triple {21383#(<= main_~i~0 15)} assume true; {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {21383#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,371 INFO L273 TraceCheckUtils]: 68: Hoare triple {21383#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,372 INFO L273 TraceCheckUtils]: 69: Hoare triple {21383#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,372 INFO L273 TraceCheckUtils]: 70: Hoare triple {21384#(<= main_~i~0 16)} assume true; {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,373 INFO L273 TraceCheckUtils]: 71: Hoare triple {21384#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,373 INFO L273 TraceCheckUtils]: 72: Hoare triple {21384#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,374 INFO L273 TraceCheckUtils]: 73: Hoare triple {21384#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,375 INFO L273 TraceCheckUtils]: 74: Hoare triple {21385#(<= main_~i~0 17)} assume true; {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,375 INFO L273 TraceCheckUtils]: 75: Hoare triple {21385#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,375 INFO L273 TraceCheckUtils]: 76: Hoare triple {21385#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,376 INFO L273 TraceCheckUtils]: 77: Hoare triple {21385#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,377 INFO L273 TraceCheckUtils]: 78: Hoare triple {21386#(<= main_~i~0 18)} assume true; {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {21386#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,378 INFO L273 TraceCheckUtils]: 80: Hoare triple {21386#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,378 INFO L273 TraceCheckUtils]: 81: Hoare triple {21386#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,379 INFO L273 TraceCheckUtils]: 82: Hoare triple {21387#(<= main_~i~0 19)} assume true; {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,379 INFO L273 TraceCheckUtils]: 83: Hoare triple {21387#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,380 INFO L273 TraceCheckUtils]: 84: Hoare triple {21387#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,380 INFO L273 TraceCheckUtils]: 85: Hoare triple {21387#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,381 INFO L273 TraceCheckUtils]: 86: Hoare triple {21388#(<= main_~i~0 20)} assume true; {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,381 INFO L273 TraceCheckUtils]: 87: Hoare triple {21388#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,382 INFO L273 TraceCheckUtils]: 88: Hoare triple {21388#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,382 INFO L273 TraceCheckUtils]: 89: Hoare triple {21388#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,383 INFO L273 TraceCheckUtils]: 90: Hoare triple {21389#(<= main_~i~0 21)} assume true; {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,383 INFO L273 TraceCheckUtils]: 91: Hoare triple {21389#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,384 INFO L273 TraceCheckUtils]: 92: Hoare triple {21389#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,384 INFO L273 TraceCheckUtils]: 93: Hoare triple {21389#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,385 INFO L273 TraceCheckUtils]: 94: Hoare triple {21390#(<= main_~i~0 22)} assume true; {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,385 INFO L273 TraceCheckUtils]: 95: Hoare triple {21390#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,386 INFO L273 TraceCheckUtils]: 96: Hoare triple {21390#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,387 INFO L273 TraceCheckUtils]: 97: Hoare triple {21390#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,387 INFO L273 TraceCheckUtils]: 98: Hoare triple {21391#(<= main_~i~0 23)} assume true; {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {21391#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,388 INFO L273 TraceCheckUtils]: 100: Hoare triple {21391#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,389 INFO L273 TraceCheckUtils]: 101: Hoare triple {21391#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {21392#(<= main_~i~0 24)} assume true; {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,390 INFO L273 TraceCheckUtils]: 103: Hoare triple {21392#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,390 INFO L273 TraceCheckUtils]: 104: Hoare triple {21392#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,391 INFO L273 TraceCheckUtils]: 105: Hoare triple {21392#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,391 INFO L273 TraceCheckUtils]: 106: Hoare triple {21393#(<= main_~i~0 25)} assume true; {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,392 INFO L273 TraceCheckUtils]: 107: Hoare triple {21393#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,392 INFO L273 TraceCheckUtils]: 108: Hoare triple {21393#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,393 INFO L273 TraceCheckUtils]: 109: Hoare triple {21393#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,393 INFO L273 TraceCheckUtils]: 110: Hoare triple {21394#(<= main_~i~0 26)} assume true; {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,394 INFO L273 TraceCheckUtils]: 111: Hoare triple {21394#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,394 INFO L273 TraceCheckUtils]: 112: Hoare triple {21394#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,395 INFO L273 TraceCheckUtils]: 113: Hoare triple {21394#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,395 INFO L273 TraceCheckUtils]: 114: Hoare triple {21395#(<= main_~i~0 27)} assume true; {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,396 INFO L273 TraceCheckUtils]: 115: Hoare triple {21395#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,396 INFO L273 TraceCheckUtils]: 116: Hoare triple {21395#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,397 INFO L273 TraceCheckUtils]: 117: Hoare triple {21395#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,398 INFO L273 TraceCheckUtils]: 118: Hoare triple {21396#(<= main_~i~0 28)} assume true; {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,398 INFO L273 TraceCheckUtils]: 119: Hoare triple {21396#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,398 INFO L273 TraceCheckUtils]: 120: Hoare triple {21396#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,399 INFO L273 TraceCheckUtils]: 121: Hoare triple {21396#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,400 INFO L273 TraceCheckUtils]: 122: Hoare triple {21397#(<= main_~i~0 29)} assume true; {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,400 INFO L273 TraceCheckUtils]: 123: Hoare triple {21397#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,401 INFO L273 TraceCheckUtils]: 124: Hoare triple {21397#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,401 INFO L273 TraceCheckUtils]: 125: Hoare triple {21397#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,402 INFO L273 TraceCheckUtils]: 126: Hoare triple {21398#(<= main_~i~0 30)} assume true; {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,402 INFO L273 TraceCheckUtils]: 127: Hoare triple {21398#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,403 INFO L273 TraceCheckUtils]: 128: Hoare triple {21398#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,403 INFO L273 TraceCheckUtils]: 129: Hoare triple {21398#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21399#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:05,404 INFO L273 TraceCheckUtils]: 130: Hoare triple {21399#(<= main_~i~0 31)} assume true; {21399#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:05,404 INFO L273 TraceCheckUtils]: 131: Hoare triple {21399#(<= main_~i~0 31)} assume !(~i~0 < 100000); {21367#false} is VALID [2018-11-18 22:58:05,405 INFO L273 TraceCheckUtils]: 132: Hoare triple {21367#false} havoc ~x~0;~x~0 := 0; {21367#false} is VALID [2018-11-18 22:58:05,405 INFO L273 TraceCheckUtils]: 133: Hoare triple {21367#false} assume true; {21367#false} is VALID [2018-11-18 22:58:05,405 INFO L273 TraceCheckUtils]: 134: Hoare triple {21367#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {21367#false} is VALID [2018-11-18 22:58:05,405 INFO L256 TraceCheckUtils]: 135: Hoare triple {21367#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {21367#false} is VALID [2018-11-18 22:58:05,405 INFO L273 TraceCheckUtils]: 136: Hoare triple {21367#false} ~cond := #in~cond; {21367#false} is VALID [2018-11-18 22:58:05,406 INFO L273 TraceCheckUtils]: 137: Hoare triple {21367#false} assume 0 == ~cond; {21367#false} is VALID [2018-11-18 22:58:05,406 INFO L273 TraceCheckUtils]: 138: Hoare triple {21367#false} assume !false; {21367#false} is VALID [2018-11-18 22:58:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:05,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:05,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:05,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:05,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {21366#true} call ULTIMATE.init(); {21366#true} is VALID [2018-11-18 22:58:05,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {21366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21366#true} is VALID [2018-11-18 22:58:05,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {21366#true} assume true; {21366#true} is VALID [2018-11-18 22:58:05,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21366#true} {21366#true} #73#return; {21366#true} is VALID [2018-11-18 22:58:05,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {21366#true} call #t~ret7 := main(); {21366#true} is VALID [2018-11-18 22:58:05,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {21366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {21418#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:05,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {21418#(<= main_~i~0 0)} assume true; {21418#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:05,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {21418#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21418#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:05,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {21418#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21418#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:05,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {21418#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {21369#(<= main_~i~0 1)} assume true; {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {21369#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {21369#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21369#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:05,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {21369#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {21370#(<= main_~i~0 2)} assume true; {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {21370#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {21370#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21370#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:05,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {21370#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {21371#(<= main_~i~0 3)} assume true; {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {21371#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {21371#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21371#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:05,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {21371#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {21372#(<= main_~i~0 4)} assume true; {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {21372#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {21372#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21372#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:05,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {21372#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {21373#(<= main_~i~0 5)} assume true; {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {21373#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {21373#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21373#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:05,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {21373#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {21374#(<= main_~i~0 6)} assume true; {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {21374#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {21374#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21374#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:05,801 INFO L273 TraceCheckUtils]: 33: Hoare triple {21374#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {21375#(<= main_~i~0 7)} assume true; {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {21375#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {21375#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21375#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:05,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {21375#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {21376#(<= main_~i~0 8)} assume true; {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {21376#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {21376#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21376#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:05,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {21376#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {21377#(<= main_~i~0 9)} assume true; {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {21377#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {21377#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21377#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:05,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {21377#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,808 INFO L273 TraceCheckUtils]: 46: Hoare triple {21378#(<= main_~i~0 10)} assume true; {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,808 INFO L273 TraceCheckUtils]: 47: Hoare triple {21378#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,809 INFO L273 TraceCheckUtils]: 48: Hoare triple {21378#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21378#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:05,809 INFO L273 TraceCheckUtils]: 49: Hoare triple {21378#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,810 INFO L273 TraceCheckUtils]: 50: Hoare triple {21379#(<= main_~i~0 11)} assume true; {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {21379#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {21379#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21379#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:05,811 INFO L273 TraceCheckUtils]: 53: Hoare triple {21379#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,812 INFO L273 TraceCheckUtils]: 54: Hoare triple {21380#(<= main_~i~0 12)} assume true; {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {21380#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {21380#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21380#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:05,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {21380#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,814 INFO L273 TraceCheckUtils]: 58: Hoare triple {21381#(<= main_~i~0 13)} assume true; {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,814 INFO L273 TraceCheckUtils]: 59: Hoare triple {21381#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,815 INFO L273 TraceCheckUtils]: 60: Hoare triple {21381#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21381#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:05,816 INFO L273 TraceCheckUtils]: 61: Hoare triple {21381#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,816 INFO L273 TraceCheckUtils]: 62: Hoare triple {21382#(<= main_~i~0 14)} assume true; {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,816 INFO L273 TraceCheckUtils]: 63: Hoare triple {21382#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {21382#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21382#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:05,818 INFO L273 TraceCheckUtils]: 65: Hoare triple {21382#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,818 INFO L273 TraceCheckUtils]: 66: Hoare triple {21383#(<= main_~i~0 15)} assume true; {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,819 INFO L273 TraceCheckUtils]: 67: Hoare triple {21383#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,819 INFO L273 TraceCheckUtils]: 68: Hoare triple {21383#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21383#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:05,820 INFO L273 TraceCheckUtils]: 69: Hoare triple {21383#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,820 INFO L273 TraceCheckUtils]: 70: Hoare triple {21384#(<= main_~i~0 16)} assume true; {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,821 INFO L273 TraceCheckUtils]: 71: Hoare triple {21384#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,821 INFO L273 TraceCheckUtils]: 72: Hoare triple {21384#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21384#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:05,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {21384#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,822 INFO L273 TraceCheckUtils]: 74: Hoare triple {21385#(<= main_~i~0 17)} assume true; {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {21385#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,823 INFO L273 TraceCheckUtils]: 76: Hoare triple {21385#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21385#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:05,824 INFO L273 TraceCheckUtils]: 77: Hoare triple {21385#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,824 INFO L273 TraceCheckUtils]: 78: Hoare triple {21386#(<= main_~i~0 18)} assume true; {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,825 INFO L273 TraceCheckUtils]: 79: Hoare triple {21386#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,825 INFO L273 TraceCheckUtils]: 80: Hoare triple {21386#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21386#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:05,826 INFO L273 TraceCheckUtils]: 81: Hoare triple {21386#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,826 INFO L273 TraceCheckUtils]: 82: Hoare triple {21387#(<= main_~i~0 19)} assume true; {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,827 INFO L273 TraceCheckUtils]: 83: Hoare triple {21387#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,827 INFO L273 TraceCheckUtils]: 84: Hoare triple {21387#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21387#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:05,828 INFO L273 TraceCheckUtils]: 85: Hoare triple {21387#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,828 INFO L273 TraceCheckUtils]: 86: Hoare triple {21388#(<= main_~i~0 20)} assume true; {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,829 INFO L273 TraceCheckUtils]: 87: Hoare triple {21388#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,829 INFO L273 TraceCheckUtils]: 88: Hoare triple {21388#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21388#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:05,830 INFO L273 TraceCheckUtils]: 89: Hoare triple {21388#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,830 INFO L273 TraceCheckUtils]: 90: Hoare triple {21389#(<= main_~i~0 21)} assume true; {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,831 INFO L273 TraceCheckUtils]: 91: Hoare triple {21389#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,831 INFO L273 TraceCheckUtils]: 92: Hoare triple {21389#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21389#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:05,832 INFO L273 TraceCheckUtils]: 93: Hoare triple {21389#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,833 INFO L273 TraceCheckUtils]: 94: Hoare triple {21390#(<= main_~i~0 22)} assume true; {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,833 INFO L273 TraceCheckUtils]: 95: Hoare triple {21390#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,833 INFO L273 TraceCheckUtils]: 96: Hoare triple {21390#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21390#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:05,834 INFO L273 TraceCheckUtils]: 97: Hoare triple {21390#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,835 INFO L273 TraceCheckUtils]: 98: Hoare triple {21391#(<= main_~i~0 23)} assume true; {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,835 INFO L273 TraceCheckUtils]: 99: Hoare triple {21391#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,836 INFO L273 TraceCheckUtils]: 100: Hoare triple {21391#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21391#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:05,836 INFO L273 TraceCheckUtils]: 101: Hoare triple {21391#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,837 INFO L273 TraceCheckUtils]: 102: Hoare triple {21392#(<= main_~i~0 24)} assume true; {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,837 INFO L273 TraceCheckUtils]: 103: Hoare triple {21392#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,838 INFO L273 TraceCheckUtils]: 104: Hoare triple {21392#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21392#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:05,838 INFO L273 TraceCheckUtils]: 105: Hoare triple {21392#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,839 INFO L273 TraceCheckUtils]: 106: Hoare triple {21393#(<= main_~i~0 25)} assume true; {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,839 INFO L273 TraceCheckUtils]: 107: Hoare triple {21393#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,840 INFO L273 TraceCheckUtils]: 108: Hoare triple {21393#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21393#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:05,840 INFO L273 TraceCheckUtils]: 109: Hoare triple {21393#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,841 INFO L273 TraceCheckUtils]: 110: Hoare triple {21394#(<= main_~i~0 26)} assume true; {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,841 INFO L273 TraceCheckUtils]: 111: Hoare triple {21394#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,842 INFO L273 TraceCheckUtils]: 112: Hoare triple {21394#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21394#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:05,842 INFO L273 TraceCheckUtils]: 113: Hoare triple {21394#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,843 INFO L273 TraceCheckUtils]: 114: Hoare triple {21395#(<= main_~i~0 27)} assume true; {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,843 INFO L273 TraceCheckUtils]: 115: Hoare triple {21395#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,844 INFO L273 TraceCheckUtils]: 116: Hoare triple {21395#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21395#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:05,844 INFO L273 TraceCheckUtils]: 117: Hoare triple {21395#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,845 INFO L273 TraceCheckUtils]: 118: Hoare triple {21396#(<= main_~i~0 28)} assume true; {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,845 INFO L273 TraceCheckUtils]: 119: Hoare triple {21396#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,846 INFO L273 TraceCheckUtils]: 120: Hoare triple {21396#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21396#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:05,847 INFO L273 TraceCheckUtils]: 121: Hoare triple {21396#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,847 INFO L273 TraceCheckUtils]: 122: Hoare triple {21397#(<= main_~i~0 29)} assume true; {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,848 INFO L273 TraceCheckUtils]: 123: Hoare triple {21397#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,848 INFO L273 TraceCheckUtils]: 124: Hoare triple {21397#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21397#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:05,849 INFO L273 TraceCheckUtils]: 125: Hoare triple {21397#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,849 INFO L273 TraceCheckUtils]: 126: Hoare triple {21398#(<= main_~i~0 30)} assume true; {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,850 INFO L273 TraceCheckUtils]: 127: Hoare triple {21398#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,850 INFO L273 TraceCheckUtils]: 128: Hoare triple {21398#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21398#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:05,851 INFO L273 TraceCheckUtils]: 129: Hoare triple {21398#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21399#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:05,851 INFO L273 TraceCheckUtils]: 130: Hoare triple {21399#(<= main_~i~0 31)} assume true; {21399#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:05,852 INFO L273 TraceCheckUtils]: 131: Hoare triple {21399#(<= main_~i~0 31)} assume !(~i~0 < 100000); {21367#false} is VALID [2018-11-18 22:58:05,852 INFO L273 TraceCheckUtils]: 132: Hoare triple {21367#false} havoc ~x~0;~x~0 := 0; {21367#false} is VALID [2018-11-18 22:58:05,852 INFO L273 TraceCheckUtils]: 133: Hoare triple {21367#false} assume true; {21367#false} is VALID [2018-11-18 22:58:05,852 INFO L273 TraceCheckUtils]: 134: Hoare triple {21367#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {21367#false} is VALID [2018-11-18 22:58:05,853 INFO L256 TraceCheckUtils]: 135: Hoare triple {21367#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {21367#false} is VALID [2018-11-18 22:58:05,853 INFO L273 TraceCheckUtils]: 136: Hoare triple {21367#false} ~cond := #in~cond; {21367#false} is VALID [2018-11-18 22:58:05,853 INFO L273 TraceCheckUtils]: 137: Hoare triple {21367#false} assume 0 == ~cond; {21367#false} is VALID [2018-11-18 22:58:05,853 INFO L273 TraceCheckUtils]: 138: Hoare triple {21367#false} assume !false; {21367#false} is VALID [2018-11-18 22:58:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:05,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-18 22:58:05,885 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-11-18 22:58:05,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:05,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-18 22:58:06,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:06,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-18 22:58:06,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-18 22:58:06,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:58:06,027 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand 35 states. [2018-11-18 22:58:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:06,798 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2018-11-18 22:58:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 22:58:06,798 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-11-18 22:58:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:58:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 213 transitions. [2018-11-18 22:58:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 22:58:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 213 transitions. [2018-11-18 22:58:06,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 213 transitions. [2018-11-18 22:58:07,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:07,066 INFO L225 Difference]: With dead ends: 174 [2018-11-18 22:58:07,066 INFO L226 Difference]: Without dead ends: 156 [2018-11-18 22:58:07,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 22:58:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-18 22:58:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-11-18 22:58:07,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:07,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 154 states. [2018-11-18 22:58:07,183 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 154 states. [2018-11-18 22:58:07,183 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 154 states. [2018-11-18 22:58:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:07,185 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2018-11-18 22:58:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2018-11-18 22:58:07,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:07,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:07,186 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 156 states. [2018-11-18 22:58:07,186 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 156 states. [2018-11-18 22:58:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:07,188 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2018-11-18 22:58:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2018-11-18 22:58:07,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:07,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:07,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:07,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-18 22:58:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2018-11-18 22:58:07,192 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 139 [2018-11-18 22:58:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:07,192 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2018-11-18 22:58:07,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-18 22:58:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2018-11-18 22:58:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 22:58:07,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:07,193 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:07,193 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:07,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1516947406, now seen corresponding path program 32 times [2018-11-18 22:58:07,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:07,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:07,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:58:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:08,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {22546#true} call ULTIMATE.init(); {22546#true} is VALID [2018-11-18 22:58:08,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {22546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22546#true} is VALID [2018-11-18 22:58:08,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {22546#true} assume true; {22546#true} is VALID [2018-11-18 22:58:08,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22546#true} {22546#true} #73#return; {22546#true} is VALID [2018-11-18 22:58:08,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {22546#true} call #t~ret7 := main(); {22546#true} is VALID [2018-11-18 22:58:08,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {22546#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {22548#(= main_~i~0 0)} is VALID [2018-11-18 22:58:08,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {22548#(= main_~i~0 0)} assume true; {22548#(= main_~i~0 0)} is VALID [2018-11-18 22:58:08,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {22548#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22548#(= main_~i~0 0)} is VALID [2018-11-18 22:58:08,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {22548#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22548#(= main_~i~0 0)} is VALID [2018-11-18 22:58:08,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {22548#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {22549#(<= main_~i~0 1)} assume true; {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {22549#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {22549#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {22549#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {22550#(<= main_~i~0 2)} assume true; {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {22550#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {22550#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {22550#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {22551#(<= main_~i~0 3)} assume true; {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {22551#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {22551#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {22551#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {22552#(<= main_~i~0 4)} assume true; {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {22552#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {22552#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,172 INFO L273 TraceCheckUtils]: 25: Hoare triple {22552#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {22553#(<= main_~i~0 5)} assume true; {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {22553#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {22553#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {22553#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {22554#(<= main_~i~0 6)} assume true; {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {22554#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {22554#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {22554#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {22555#(<= main_~i~0 7)} assume true; {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {22555#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {22555#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {22555#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {22556#(<= main_~i~0 8)} assume true; {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {22556#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {22556#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {22556#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {22557#(<= main_~i~0 9)} assume true; {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,182 INFO L273 TraceCheckUtils]: 43: Hoare triple {22557#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {22557#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,183 INFO L273 TraceCheckUtils]: 45: Hoare triple {22557#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {22558#(<= main_~i~0 10)} assume true; {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {22558#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {22558#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {22558#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {22559#(<= main_~i~0 11)} assume true; {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,186 INFO L273 TraceCheckUtils]: 51: Hoare triple {22559#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {22559#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {22559#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {22560#(<= main_~i~0 12)} assume true; {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,189 INFO L273 TraceCheckUtils]: 55: Hoare triple {22560#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,189 INFO L273 TraceCheckUtils]: 56: Hoare triple {22560#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,190 INFO L273 TraceCheckUtils]: 57: Hoare triple {22560#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,190 INFO L273 TraceCheckUtils]: 58: Hoare triple {22561#(<= main_~i~0 13)} assume true; {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {22561#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,191 INFO L273 TraceCheckUtils]: 60: Hoare triple {22561#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,192 INFO L273 TraceCheckUtils]: 61: Hoare triple {22561#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,193 INFO L273 TraceCheckUtils]: 62: Hoare triple {22562#(<= main_~i~0 14)} assume true; {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,193 INFO L273 TraceCheckUtils]: 63: Hoare triple {22562#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,194 INFO L273 TraceCheckUtils]: 64: Hoare triple {22562#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,194 INFO L273 TraceCheckUtils]: 65: Hoare triple {22562#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,195 INFO L273 TraceCheckUtils]: 66: Hoare triple {22563#(<= main_~i~0 15)} assume true; {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,195 INFO L273 TraceCheckUtils]: 67: Hoare triple {22563#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,196 INFO L273 TraceCheckUtils]: 68: Hoare triple {22563#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,196 INFO L273 TraceCheckUtils]: 69: Hoare triple {22563#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,197 INFO L273 TraceCheckUtils]: 70: Hoare triple {22564#(<= main_~i~0 16)} assume true; {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,197 INFO L273 TraceCheckUtils]: 71: Hoare triple {22564#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,198 INFO L273 TraceCheckUtils]: 72: Hoare triple {22564#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,199 INFO L273 TraceCheckUtils]: 73: Hoare triple {22564#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,199 INFO L273 TraceCheckUtils]: 74: Hoare triple {22565#(<= main_~i~0 17)} assume true; {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,200 INFO L273 TraceCheckUtils]: 75: Hoare triple {22565#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,200 INFO L273 TraceCheckUtils]: 76: Hoare triple {22565#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,201 INFO L273 TraceCheckUtils]: 77: Hoare triple {22565#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,201 INFO L273 TraceCheckUtils]: 78: Hoare triple {22566#(<= main_~i~0 18)} assume true; {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,202 INFO L273 TraceCheckUtils]: 79: Hoare triple {22566#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,202 INFO L273 TraceCheckUtils]: 80: Hoare triple {22566#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,203 INFO L273 TraceCheckUtils]: 81: Hoare triple {22566#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,204 INFO L273 TraceCheckUtils]: 82: Hoare triple {22567#(<= main_~i~0 19)} assume true; {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,204 INFO L273 TraceCheckUtils]: 83: Hoare triple {22567#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,205 INFO L273 TraceCheckUtils]: 84: Hoare triple {22567#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,205 INFO L273 TraceCheckUtils]: 85: Hoare triple {22567#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,206 INFO L273 TraceCheckUtils]: 86: Hoare triple {22568#(<= main_~i~0 20)} assume true; {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,206 INFO L273 TraceCheckUtils]: 87: Hoare triple {22568#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,207 INFO L273 TraceCheckUtils]: 88: Hoare triple {22568#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,207 INFO L273 TraceCheckUtils]: 89: Hoare triple {22568#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,208 INFO L273 TraceCheckUtils]: 90: Hoare triple {22569#(<= main_~i~0 21)} assume true; {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,208 INFO L273 TraceCheckUtils]: 91: Hoare triple {22569#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,209 INFO L273 TraceCheckUtils]: 92: Hoare triple {22569#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,210 INFO L273 TraceCheckUtils]: 93: Hoare triple {22569#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,210 INFO L273 TraceCheckUtils]: 94: Hoare triple {22570#(<= main_~i~0 22)} assume true; {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,211 INFO L273 TraceCheckUtils]: 95: Hoare triple {22570#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,211 INFO L273 TraceCheckUtils]: 96: Hoare triple {22570#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,212 INFO L273 TraceCheckUtils]: 97: Hoare triple {22570#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,212 INFO L273 TraceCheckUtils]: 98: Hoare triple {22571#(<= main_~i~0 23)} assume true; {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,213 INFO L273 TraceCheckUtils]: 99: Hoare triple {22571#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,213 INFO L273 TraceCheckUtils]: 100: Hoare triple {22571#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,214 INFO L273 TraceCheckUtils]: 101: Hoare triple {22571#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,214 INFO L273 TraceCheckUtils]: 102: Hoare triple {22572#(<= main_~i~0 24)} assume true; {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,215 INFO L273 TraceCheckUtils]: 103: Hoare triple {22572#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,215 INFO L273 TraceCheckUtils]: 104: Hoare triple {22572#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,216 INFO L273 TraceCheckUtils]: 105: Hoare triple {22572#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,216 INFO L273 TraceCheckUtils]: 106: Hoare triple {22573#(<= main_~i~0 25)} assume true; {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,217 INFO L273 TraceCheckUtils]: 107: Hoare triple {22573#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,217 INFO L273 TraceCheckUtils]: 108: Hoare triple {22573#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,218 INFO L273 TraceCheckUtils]: 109: Hoare triple {22573#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,218 INFO L273 TraceCheckUtils]: 110: Hoare triple {22574#(<= main_~i~0 26)} assume true; {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,219 INFO L273 TraceCheckUtils]: 111: Hoare triple {22574#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,219 INFO L273 TraceCheckUtils]: 112: Hoare triple {22574#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,220 INFO L273 TraceCheckUtils]: 113: Hoare triple {22574#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,220 INFO L273 TraceCheckUtils]: 114: Hoare triple {22575#(<= main_~i~0 27)} assume true; {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,239 INFO L273 TraceCheckUtils]: 115: Hoare triple {22575#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,239 INFO L273 TraceCheckUtils]: 116: Hoare triple {22575#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,240 INFO L273 TraceCheckUtils]: 117: Hoare triple {22575#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,240 INFO L273 TraceCheckUtils]: 118: Hoare triple {22576#(<= main_~i~0 28)} assume true; {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,241 INFO L273 TraceCheckUtils]: 119: Hoare triple {22576#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,241 INFO L273 TraceCheckUtils]: 120: Hoare triple {22576#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,241 INFO L273 TraceCheckUtils]: 121: Hoare triple {22576#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,242 INFO L273 TraceCheckUtils]: 122: Hoare triple {22577#(<= main_~i~0 29)} assume true; {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,242 INFO L273 TraceCheckUtils]: 123: Hoare triple {22577#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,242 INFO L273 TraceCheckUtils]: 124: Hoare triple {22577#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,243 INFO L273 TraceCheckUtils]: 125: Hoare triple {22577#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,243 INFO L273 TraceCheckUtils]: 126: Hoare triple {22578#(<= main_~i~0 30)} assume true; {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,243 INFO L273 TraceCheckUtils]: 127: Hoare triple {22578#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,243 INFO L273 TraceCheckUtils]: 128: Hoare triple {22578#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,244 INFO L273 TraceCheckUtils]: 129: Hoare triple {22578#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,244 INFO L273 TraceCheckUtils]: 130: Hoare triple {22579#(<= main_~i~0 31)} assume true; {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,245 INFO L273 TraceCheckUtils]: 131: Hoare triple {22579#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,245 INFO L273 TraceCheckUtils]: 132: Hoare triple {22579#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,246 INFO L273 TraceCheckUtils]: 133: Hoare triple {22579#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,247 INFO L273 TraceCheckUtils]: 134: Hoare triple {22580#(<= main_~i~0 32)} assume true; {22580#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,247 INFO L273 TraceCheckUtils]: 135: Hoare triple {22580#(<= main_~i~0 32)} assume !(~i~0 < 100000); {22547#false} is VALID [2018-11-18 22:58:08,247 INFO L273 TraceCheckUtils]: 136: Hoare triple {22547#false} havoc ~x~0;~x~0 := 0; {22547#false} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 137: Hoare triple {22547#false} assume true; {22547#false} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 138: Hoare triple {22547#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {22547#false} is VALID [2018-11-18 22:58:08,248 INFO L256 TraceCheckUtils]: 139: Hoare triple {22547#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {22547#false} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 140: Hoare triple {22547#false} ~cond := #in~cond; {22547#false} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 141: Hoare triple {22547#false} assume 0 == ~cond; {22547#false} is VALID [2018-11-18 22:58:08,248 INFO L273 TraceCheckUtils]: 142: Hoare triple {22547#false} assume !false; {22547#false} is VALID [2018-11-18 22:58:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:08,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:08,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:58:08,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:58:08,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:08,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:08,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {22546#true} call ULTIMATE.init(); {22546#true} is VALID [2018-11-18 22:58:08,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {22546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22546#true} is VALID [2018-11-18 22:58:08,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {22546#true} assume true; {22546#true} is VALID [2018-11-18 22:58:08,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22546#true} {22546#true} #73#return; {22546#true} is VALID [2018-11-18 22:58:08,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {22546#true} call #t~ret7 := main(); {22546#true} is VALID [2018-11-18 22:58:08,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {22546#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {22599#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {22599#(<= main_~i~0 0)} assume true; {22599#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {22599#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22599#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {22599#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22599#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:08,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {22599#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {22549#(<= main_~i~0 1)} assume true; {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {22549#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {22549#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22549#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:08,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {22549#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {22550#(<= main_~i~0 2)} assume true; {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {22550#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {22550#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22550#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:08,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {22550#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {22551#(<= main_~i~0 3)} assume true; {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {22551#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {22551#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22551#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:08,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {22551#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {22552#(<= main_~i~0 4)} assume true; {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {22552#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {22552#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22552#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:08,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {22552#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {22553#(<= main_~i~0 5)} assume true; {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {22553#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {22553#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22553#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:08,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {22553#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {22554#(<= main_~i~0 6)} assume true; {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {22554#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {22554#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22554#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:08,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {22554#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {22555#(<= main_~i~0 7)} assume true; {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {22555#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {22555#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22555#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:08,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {22555#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {22556#(<= main_~i~0 8)} assume true; {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {22556#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,692 INFO L273 TraceCheckUtils]: 40: Hoare triple {22556#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22556#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:08,693 INFO L273 TraceCheckUtils]: 41: Hoare triple {22556#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {22557#(<= main_~i~0 9)} assume true; {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,694 INFO L273 TraceCheckUtils]: 43: Hoare triple {22557#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {22557#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22557#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:08,695 INFO L273 TraceCheckUtils]: 45: Hoare triple {22557#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {22558#(<= main_~i~0 10)} assume true; {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,696 INFO L273 TraceCheckUtils]: 47: Hoare triple {22558#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {22558#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22558#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:08,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {22558#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {22559#(<= main_~i~0 11)} assume true; {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {22559#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {22559#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22559#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:08,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {22559#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {22560#(<= main_~i~0 12)} assume true; {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {22560#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,704 INFO L273 TraceCheckUtils]: 56: Hoare triple {22560#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22560#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:08,705 INFO L273 TraceCheckUtils]: 57: Hoare triple {22560#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,705 INFO L273 TraceCheckUtils]: 58: Hoare triple {22561#(<= main_~i~0 13)} assume true; {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {22561#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,706 INFO L273 TraceCheckUtils]: 60: Hoare triple {22561#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22561#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:08,706 INFO L273 TraceCheckUtils]: 61: Hoare triple {22561#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {22562#(<= main_~i~0 14)} assume true; {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,707 INFO L273 TraceCheckUtils]: 63: Hoare triple {22562#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,707 INFO L273 TraceCheckUtils]: 64: Hoare triple {22562#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22562#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:08,708 INFO L273 TraceCheckUtils]: 65: Hoare triple {22562#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,708 INFO L273 TraceCheckUtils]: 66: Hoare triple {22563#(<= main_~i~0 15)} assume true; {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,708 INFO L273 TraceCheckUtils]: 67: Hoare triple {22563#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,708 INFO L273 TraceCheckUtils]: 68: Hoare triple {22563#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22563#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:08,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {22563#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,710 INFO L273 TraceCheckUtils]: 70: Hoare triple {22564#(<= main_~i~0 16)} assume true; {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,710 INFO L273 TraceCheckUtils]: 71: Hoare triple {22564#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,710 INFO L273 TraceCheckUtils]: 72: Hoare triple {22564#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22564#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:08,711 INFO L273 TraceCheckUtils]: 73: Hoare triple {22564#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,712 INFO L273 TraceCheckUtils]: 74: Hoare triple {22565#(<= main_~i~0 17)} assume true; {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,712 INFO L273 TraceCheckUtils]: 75: Hoare triple {22565#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,713 INFO L273 TraceCheckUtils]: 76: Hoare triple {22565#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22565#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:08,713 INFO L273 TraceCheckUtils]: 77: Hoare triple {22565#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,714 INFO L273 TraceCheckUtils]: 78: Hoare triple {22566#(<= main_~i~0 18)} assume true; {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,714 INFO L273 TraceCheckUtils]: 79: Hoare triple {22566#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,715 INFO L273 TraceCheckUtils]: 80: Hoare triple {22566#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22566#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:08,715 INFO L273 TraceCheckUtils]: 81: Hoare triple {22566#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,716 INFO L273 TraceCheckUtils]: 82: Hoare triple {22567#(<= main_~i~0 19)} assume true; {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,716 INFO L273 TraceCheckUtils]: 83: Hoare triple {22567#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,717 INFO L273 TraceCheckUtils]: 84: Hoare triple {22567#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22567#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:08,717 INFO L273 TraceCheckUtils]: 85: Hoare triple {22567#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,718 INFO L273 TraceCheckUtils]: 86: Hoare triple {22568#(<= main_~i~0 20)} assume true; {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,718 INFO L273 TraceCheckUtils]: 87: Hoare triple {22568#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,721 INFO L273 TraceCheckUtils]: 88: Hoare triple {22568#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22568#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:08,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {22568#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {22569#(<= main_~i~0 21)} assume true; {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {22569#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {22569#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22569#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:08,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {22569#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {22570#(<= main_~i~0 22)} assume true; {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,724 INFO L273 TraceCheckUtils]: 95: Hoare triple {22570#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,724 INFO L273 TraceCheckUtils]: 96: Hoare triple {22570#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22570#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:08,724 INFO L273 TraceCheckUtils]: 97: Hoare triple {22570#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {22571#(<= main_~i~0 23)} assume true; {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,725 INFO L273 TraceCheckUtils]: 99: Hoare triple {22571#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,726 INFO L273 TraceCheckUtils]: 100: Hoare triple {22571#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22571#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:08,726 INFO L273 TraceCheckUtils]: 101: Hoare triple {22571#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,727 INFO L273 TraceCheckUtils]: 102: Hoare triple {22572#(<= main_~i~0 24)} assume true; {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,727 INFO L273 TraceCheckUtils]: 103: Hoare triple {22572#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,728 INFO L273 TraceCheckUtils]: 104: Hoare triple {22572#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22572#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:08,729 INFO L273 TraceCheckUtils]: 105: Hoare triple {22572#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,729 INFO L273 TraceCheckUtils]: 106: Hoare triple {22573#(<= main_~i~0 25)} assume true; {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,729 INFO L273 TraceCheckUtils]: 107: Hoare triple {22573#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,730 INFO L273 TraceCheckUtils]: 108: Hoare triple {22573#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22573#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:08,731 INFO L273 TraceCheckUtils]: 109: Hoare triple {22573#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,731 INFO L273 TraceCheckUtils]: 110: Hoare triple {22574#(<= main_~i~0 26)} assume true; {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,732 INFO L273 TraceCheckUtils]: 111: Hoare triple {22574#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,732 INFO L273 TraceCheckUtils]: 112: Hoare triple {22574#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22574#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:08,733 INFO L273 TraceCheckUtils]: 113: Hoare triple {22574#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,733 INFO L273 TraceCheckUtils]: 114: Hoare triple {22575#(<= main_~i~0 27)} assume true; {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,734 INFO L273 TraceCheckUtils]: 115: Hoare triple {22575#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,734 INFO L273 TraceCheckUtils]: 116: Hoare triple {22575#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22575#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:08,735 INFO L273 TraceCheckUtils]: 117: Hoare triple {22575#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,735 INFO L273 TraceCheckUtils]: 118: Hoare triple {22576#(<= main_~i~0 28)} assume true; {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,736 INFO L273 TraceCheckUtils]: 119: Hoare triple {22576#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,736 INFO L273 TraceCheckUtils]: 120: Hoare triple {22576#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22576#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:08,737 INFO L273 TraceCheckUtils]: 121: Hoare triple {22576#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,737 INFO L273 TraceCheckUtils]: 122: Hoare triple {22577#(<= main_~i~0 29)} assume true; {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,738 INFO L273 TraceCheckUtils]: 123: Hoare triple {22577#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,738 INFO L273 TraceCheckUtils]: 124: Hoare triple {22577#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22577#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:08,739 INFO L273 TraceCheckUtils]: 125: Hoare triple {22577#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,739 INFO L273 TraceCheckUtils]: 126: Hoare triple {22578#(<= main_~i~0 30)} assume true; {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,740 INFO L273 TraceCheckUtils]: 127: Hoare triple {22578#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,740 INFO L273 TraceCheckUtils]: 128: Hoare triple {22578#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22578#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:08,741 INFO L273 TraceCheckUtils]: 129: Hoare triple {22578#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,741 INFO L273 TraceCheckUtils]: 130: Hoare triple {22579#(<= main_~i~0 31)} assume true; {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,742 INFO L273 TraceCheckUtils]: 131: Hoare triple {22579#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,742 INFO L273 TraceCheckUtils]: 132: Hoare triple {22579#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22579#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:08,743 INFO L273 TraceCheckUtils]: 133: Hoare triple {22579#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22580#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,743 INFO L273 TraceCheckUtils]: 134: Hoare triple {22580#(<= main_~i~0 32)} assume true; {22580#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:08,744 INFO L273 TraceCheckUtils]: 135: Hoare triple {22580#(<= main_~i~0 32)} assume !(~i~0 < 100000); {22547#false} is VALID [2018-11-18 22:58:08,744 INFO L273 TraceCheckUtils]: 136: Hoare triple {22547#false} havoc ~x~0;~x~0 := 0; {22547#false} is VALID [2018-11-18 22:58:08,744 INFO L273 TraceCheckUtils]: 137: Hoare triple {22547#false} assume true; {22547#false} is VALID [2018-11-18 22:58:08,745 INFO L273 TraceCheckUtils]: 138: Hoare triple {22547#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {22547#false} is VALID [2018-11-18 22:58:08,745 INFO L256 TraceCheckUtils]: 139: Hoare triple {22547#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {22547#false} is VALID [2018-11-18 22:58:08,745 INFO L273 TraceCheckUtils]: 140: Hoare triple {22547#false} ~cond := #in~cond; {22547#false} is VALID [2018-11-18 22:58:08,745 INFO L273 TraceCheckUtils]: 141: Hoare triple {22547#false} assume 0 == ~cond; {22547#false} is VALID [2018-11-18 22:58:08,745 INFO L273 TraceCheckUtils]: 142: Hoare triple {22547#false} assume !false; {22547#false} is VALID [2018-11-18 22:58:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:08,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:08,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-18 22:58:08,778 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-18 22:58:08,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:08,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-18 22:58:08,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:08,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 22:58:08,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 22:58:08,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:58:08,913 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand 36 states. [2018-11-18 22:58:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:09,775 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-11-18 22:58:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 22:58:09,775 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-18 22:58:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:58:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 218 transitions. [2018-11-18 22:58:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 22:58:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 218 transitions. [2018-11-18 22:58:09,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 218 transitions. [2018-11-18 22:58:09,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:09,978 INFO L225 Difference]: With dead ends: 178 [2018-11-18 22:58:09,978 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 22:58:09,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 22:58:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 22:58:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-18 22:58:10,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:10,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-18 22:58:10,010 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-18 22:58:10,010 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-18 22:58:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:10,013 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2018-11-18 22:58:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2018-11-18 22:58:10,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:10,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:10,014 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-18 22:58:10,014 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-18 22:58:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:10,016 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2018-11-18 22:58:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2018-11-18 22:58:10,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:10,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:10,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:10,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 22:58:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 194 transitions. [2018-11-18 22:58:10,020 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 194 transitions. Word has length 143 [2018-11-18 22:58:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:10,020 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 194 transitions. [2018-11-18 22:58:10,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 22:58:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2018-11-18 22:58:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 22:58:10,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:10,021 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:10,022 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:10,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1875344823, now seen corresponding path program 33 times [2018-11-18 22:58:10,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:10,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:11,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {23757#true} call ULTIMATE.init(); {23757#true} is VALID [2018-11-18 22:58:11,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {23757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23757#true} is VALID [2018-11-18 22:58:11,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {23757#true} assume true; {23757#true} is VALID [2018-11-18 22:58:11,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23757#true} {23757#true} #73#return; {23757#true} is VALID [2018-11-18 22:58:11,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {23757#true} call #t~ret7 := main(); {23757#true} is VALID [2018-11-18 22:58:11,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {23757#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {23759#(= main_~i~0 0)} is VALID [2018-11-18 22:58:11,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {23759#(= main_~i~0 0)} assume true; {23759#(= main_~i~0 0)} is VALID [2018-11-18 22:58:11,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {23759#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23759#(= main_~i~0 0)} is VALID [2018-11-18 22:58:11,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {23759#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23759#(= main_~i~0 0)} is VALID [2018-11-18 22:58:11,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {23759#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {23760#(<= main_~i~0 1)} assume true; {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {23760#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {23760#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:11,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {23760#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {23761#(<= main_~i~0 2)} assume true; {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {23761#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {23761#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:11,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {23761#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {23762#(<= main_~i~0 3)} assume true; {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {23762#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {23762#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:11,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {23762#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {23763#(<= main_~i~0 4)} assume true; {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {23763#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {23763#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:11,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {23763#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {23764#(<= main_~i~0 5)} assume true; {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {23764#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {23764#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:11,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {23764#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {23765#(<= main_~i~0 6)} assume true; {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {23765#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {23765#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:11,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {23765#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {23766#(<= main_~i~0 7)} assume true; {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {23766#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {23766#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:11,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {23766#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,527 INFO L273 TraceCheckUtils]: 38: Hoare triple {23767#(<= main_~i~0 8)} assume true; {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {23767#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {23767#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:11,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {23767#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {23768#(<= main_~i~0 9)} assume true; {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {23768#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {23768#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:11,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {23768#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,532 INFO L273 TraceCheckUtils]: 46: Hoare triple {23769#(<= main_~i~0 10)} assume true; {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {23769#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {23769#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:11,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {23769#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {23770#(<= main_~i~0 11)} assume true; {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {23770#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,535 INFO L273 TraceCheckUtils]: 52: Hoare triple {23770#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:11,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {23770#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {23771#(<= main_~i~0 12)} assume true; {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,537 INFO L273 TraceCheckUtils]: 55: Hoare triple {23771#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,537 INFO L273 TraceCheckUtils]: 56: Hoare triple {23771#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:11,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {23771#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,538 INFO L273 TraceCheckUtils]: 58: Hoare triple {23772#(<= main_~i~0 13)} assume true; {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {23772#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {23772#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:11,540 INFO L273 TraceCheckUtils]: 61: Hoare triple {23772#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,541 INFO L273 TraceCheckUtils]: 62: Hoare triple {23773#(<= main_~i~0 14)} assume true; {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {23773#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,542 INFO L273 TraceCheckUtils]: 64: Hoare triple {23773#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:11,542 INFO L273 TraceCheckUtils]: 65: Hoare triple {23773#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,543 INFO L273 TraceCheckUtils]: 66: Hoare triple {23774#(<= main_~i~0 15)} assume true; {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,543 INFO L273 TraceCheckUtils]: 67: Hoare triple {23774#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,544 INFO L273 TraceCheckUtils]: 68: Hoare triple {23774#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:11,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {23774#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,545 INFO L273 TraceCheckUtils]: 70: Hoare triple {23775#(<= main_~i~0 16)} assume true; {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {23775#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,546 INFO L273 TraceCheckUtils]: 72: Hoare triple {23775#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:11,547 INFO L273 TraceCheckUtils]: 73: Hoare triple {23775#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,547 INFO L273 TraceCheckUtils]: 74: Hoare triple {23776#(<= main_~i~0 17)} assume true; {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,548 INFO L273 TraceCheckUtils]: 75: Hoare triple {23776#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,548 INFO L273 TraceCheckUtils]: 76: Hoare triple {23776#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:11,549 INFO L273 TraceCheckUtils]: 77: Hoare triple {23776#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {23777#(<= main_~i~0 18)} assume true; {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,550 INFO L273 TraceCheckUtils]: 79: Hoare triple {23777#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {23777#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:11,551 INFO L273 TraceCheckUtils]: 81: Hoare triple {23777#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,551 INFO L273 TraceCheckUtils]: 82: Hoare triple {23778#(<= main_~i~0 19)} assume true; {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,552 INFO L273 TraceCheckUtils]: 83: Hoare triple {23778#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,552 INFO L273 TraceCheckUtils]: 84: Hoare triple {23778#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:11,553 INFO L273 TraceCheckUtils]: 85: Hoare triple {23778#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,554 INFO L273 TraceCheckUtils]: 86: Hoare triple {23779#(<= main_~i~0 20)} assume true; {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,554 INFO L273 TraceCheckUtils]: 87: Hoare triple {23779#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {23779#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:11,555 INFO L273 TraceCheckUtils]: 89: Hoare triple {23779#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {23780#(<= main_~i~0 21)} assume true; {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,556 INFO L273 TraceCheckUtils]: 91: Hoare triple {23780#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,557 INFO L273 TraceCheckUtils]: 92: Hoare triple {23780#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:11,557 INFO L273 TraceCheckUtils]: 93: Hoare triple {23780#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,558 INFO L273 TraceCheckUtils]: 94: Hoare triple {23781#(<= main_~i~0 22)} assume true; {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,558 INFO L273 TraceCheckUtils]: 95: Hoare triple {23781#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,559 INFO L273 TraceCheckUtils]: 96: Hoare triple {23781#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:11,560 INFO L273 TraceCheckUtils]: 97: Hoare triple {23781#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,560 INFO L273 TraceCheckUtils]: 98: Hoare triple {23782#(<= main_~i~0 23)} assume true; {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,561 INFO L273 TraceCheckUtils]: 99: Hoare triple {23782#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,561 INFO L273 TraceCheckUtils]: 100: Hoare triple {23782#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:11,562 INFO L273 TraceCheckUtils]: 101: Hoare triple {23782#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,562 INFO L273 TraceCheckUtils]: 102: Hoare triple {23783#(<= main_~i~0 24)} assume true; {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,563 INFO L273 TraceCheckUtils]: 103: Hoare triple {23783#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,563 INFO L273 TraceCheckUtils]: 104: Hoare triple {23783#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:11,564 INFO L273 TraceCheckUtils]: 105: Hoare triple {23783#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,564 INFO L273 TraceCheckUtils]: 106: Hoare triple {23784#(<= main_~i~0 25)} assume true; {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,565 INFO L273 TraceCheckUtils]: 107: Hoare triple {23784#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,565 INFO L273 TraceCheckUtils]: 108: Hoare triple {23784#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:11,566 INFO L273 TraceCheckUtils]: 109: Hoare triple {23784#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,566 INFO L273 TraceCheckUtils]: 110: Hoare triple {23785#(<= main_~i~0 26)} assume true; {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,567 INFO L273 TraceCheckUtils]: 111: Hoare triple {23785#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,567 INFO L273 TraceCheckUtils]: 112: Hoare triple {23785#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:11,568 INFO L273 TraceCheckUtils]: 113: Hoare triple {23785#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,568 INFO L273 TraceCheckUtils]: 114: Hoare triple {23786#(<= main_~i~0 27)} assume true; {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,569 INFO L273 TraceCheckUtils]: 115: Hoare triple {23786#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,569 INFO L273 TraceCheckUtils]: 116: Hoare triple {23786#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:11,570 INFO L273 TraceCheckUtils]: 117: Hoare triple {23786#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,570 INFO L273 TraceCheckUtils]: 118: Hoare triple {23787#(<= main_~i~0 28)} assume true; {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,571 INFO L273 TraceCheckUtils]: 119: Hoare triple {23787#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,571 INFO L273 TraceCheckUtils]: 120: Hoare triple {23787#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:11,572 INFO L273 TraceCheckUtils]: 121: Hoare triple {23787#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,573 INFO L273 TraceCheckUtils]: 122: Hoare triple {23788#(<= main_~i~0 29)} assume true; {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,573 INFO L273 TraceCheckUtils]: 123: Hoare triple {23788#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,573 INFO L273 TraceCheckUtils]: 124: Hoare triple {23788#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:11,574 INFO L273 TraceCheckUtils]: 125: Hoare triple {23788#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,575 INFO L273 TraceCheckUtils]: 126: Hoare triple {23789#(<= main_~i~0 30)} assume true; {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,575 INFO L273 TraceCheckUtils]: 127: Hoare triple {23789#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,576 INFO L273 TraceCheckUtils]: 128: Hoare triple {23789#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:11,576 INFO L273 TraceCheckUtils]: 129: Hoare triple {23789#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,577 INFO L273 TraceCheckUtils]: 130: Hoare triple {23790#(<= main_~i~0 31)} assume true; {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,577 INFO L273 TraceCheckUtils]: 131: Hoare triple {23790#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,578 INFO L273 TraceCheckUtils]: 132: Hoare triple {23790#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:11,578 INFO L273 TraceCheckUtils]: 133: Hoare triple {23790#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,579 INFO L273 TraceCheckUtils]: 134: Hoare triple {23791#(<= main_~i~0 32)} assume true; {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,579 INFO L273 TraceCheckUtils]: 135: Hoare triple {23791#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,580 INFO L273 TraceCheckUtils]: 136: Hoare triple {23791#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:11,580 INFO L273 TraceCheckUtils]: 137: Hoare triple {23791#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23792#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,581 INFO L273 TraceCheckUtils]: 138: Hoare triple {23792#(<= main_~i~0 33)} assume true; {23792#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:11,581 INFO L273 TraceCheckUtils]: 139: Hoare triple {23792#(<= main_~i~0 33)} assume !(~i~0 < 100000); {23758#false} is VALID [2018-11-18 22:58:11,582 INFO L273 TraceCheckUtils]: 140: Hoare triple {23758#false} havoc ~x~0;~x~0 := 0; {23758#false} is VALID [2018-11-18 22:58:11,582 INFO L273 TraceCheckUtils]: 141: Hoare triple {23758#false} assume true; {23758#false} is VALID [2018-11-18 22:58:11,582 INFO L273 TraceCheckUtils]: 142: Hoare triple {23758#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {23758#false} is VALID [2018-11-18 22:58:11,582 INFO L256 TraceCheckUtils]: 143: Hoare triple {23758#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {23758#false} is VALID [2018-11-18 22:58:11,582 INFO L273 TraceCheckUtils]: 144: Hoare triple {23758#false} ~cond := #in~cond; {23758#false} is VALID [2018-11-18 22:58:11,583 INFO L273 TraceCheckUtils]: 145: Hoare triple {23758#false} assume 0 == ~cond; {23758#false} is VALID [2018-11-18 22:58:11,583 INFO L273 TraceCheckUtils]: 146: Hoare triple {23758#false} assume !false; {23758#false} is VALID [2018-11-18 22:58:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:11,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:11,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:58:15,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-18 22:58:15,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:15,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:15,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {23757#true} call ULTIMATE.init(); {23757#true} is VALID [2018-11-18 22:58:15,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {23757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23757#true} is VALID [2018-11-18 22:58:15,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {23757#true} assume true; {23757#true} is VALID [2018-11-18 22:58:15,878 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23757#true} {23757#true} #73#return; {23757#true} is VALID [2018-11-18 22:58:15,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {23757#true} call #t~ret7 := main(); {23757#true} is VALID [2018-11-18 22:58:15,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {23757#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {23811#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:15,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {23811#(<= main_~i~0 0)} assume true; {23811#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:15,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {23811#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23811#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:15,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {23811#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23811#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:15,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {23811#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:15,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {23760#(<= main_~i~0 1)} assume true; {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:15,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {23760#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:15,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {23760#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23760#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:15,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {23760#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:15,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {23761#(<= main_~i~0 2)} assume true; {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:15,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {23761#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:15,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {23761#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23761#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:15,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {23761#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:15,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {23762#(<= main_~i~0 3)} assume true; {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:15,934 INFO L273 TraceCheckUtils]: 19: Hoare triple {23762#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:15,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {23762#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23762#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:15,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {23762#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:15,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {23763#(<= main_~i~0 4)} assume true; {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:15,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {23763#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:15,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {23763#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23763#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:15,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {23763#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:15,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {23764#(<= main_~i~0 5)} assume true; {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:15,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {23764#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:15,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {23764#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23764#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:15,940 INFO L273 TraceCheckUtils]: 29: Hoare triple {23764#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:15,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {23765#(<= main_~i~0 6)} assume true; {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:15,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {23765#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:15,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {23765#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23765#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:15,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {23765#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:15,942 INFO L273 TraceCheckUtils]: 34: Hoare triple {23766#(<= main_~i~0 7)} assume true; {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:15,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {23766#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:15,943 INFO L273 TraceCheckUtils]: 36: Hoare triple {23766#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23766#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:15,943 INFO L273 TraceCheckUtils]: 37: Hoare triple {23766#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:15,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {23767#(<= main_~i~0 8)} assume true; {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:15,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {23767#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:15,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {23767#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23767#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:15,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {23767#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:15,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {23768#(<= main_~i~0 9)} assume true; {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:15,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {23768#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:15,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {23768#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23768#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:15,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {23768#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:15,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {23769#(<= main_~i~0 10)} assume true; {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:15,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {23769#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:15,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {23769#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23769#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:15,949 INFO L273 TraceCheckUtils]: 49: Hoare triple {23769#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:15,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {23770#(<= main_~i~0 11)} assume true; {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:15,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {23770#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:15,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {23770#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23770#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:15,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {23770#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:15,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {23771#(<= main_~i~0 12)} assume true; {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:15,952 INFO L273 TraceCheckUtils]: 55: Hoare triple {23771#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:15,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {23771#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23771#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:15,953 INFO L273 TraceCheckUtils]: 57: Hoare triple {23771#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:15,954 INFO L273 TraceCheckUtils]: 58: Hoare triple {23772#(<= main_~i~0 13)} assume true; {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:15,954 INFO L273 TraceCheckUtils]: 59: Hoare triple {23772#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:15,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {23772#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23772#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:15,955 INFO L273 TraceCheckUtils]: 61: Hoare triple {23772#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:15,956 INFO L273 TraceCheckUtils]: 62: Hoare triple {23773#(<= main_~i~0 14)} assume true; {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:15,956 INFO L273 TraceCheckUtils]: 63: Hoare triple {23773#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:15,957 INFO L273 TraceCheckUtils]: 64: Hoare triple {23773#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23773#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:15,958 INFO L273 TraceCheckUtils]: 65: Hoare triple {23773#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,958 INFO L273 TraceCheckUtils]: 66: Hoare triple {23774#(<= main_~i~0 15)} assume true; {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,959 INFO L273 TraceCheckUtils]: 67: Hoare triple {23774#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,959 INFO L273 TraceCheckUtils]: 68: Hoare triple {23774#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23774#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:15,960 INFO L273 TraceCheckUtils]: 69: Hoare triple {23774#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,960 INFO L273 TraceCheckUtils]: 70: Hoare triple {23775#(<= main_~i~0 16)} assume true; {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,961 INFO L273 TraceCheckUtils]: 71: Hoare triple {23775#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,961 INFO L273 TraceCheckUtils]: 72: Hoare triple {23775#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23775#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:15,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {23775#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,962 INFO L273 TraceCheckUtils]: 74: Hoare triple {23776#(<= main_~i~0 17)} assume true; {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,963 INFO L273 TraceCheckUtils]: 75: Hoare triple {23776#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,963 INFO L273 TraceCheckUtils]: 76: Hoare triple {23776#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23776#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:15,964 INFO L273 TraceCheckUtils]: 77: Hoare triple {23776#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,964 INFO L273 TraceCheckUtils]: 78: Hoare triple {23777#(<= main_~i~0 18)} assume true; {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,965 INFO L273 TraceCheckUtils]: 79: Hoare triple {23777#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,965 INFO L273 TraceCheckUtils]: 80: Hoare triple {23777#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23777#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:15,966 INFO L273 TraceCheckUtils]: 81: Hoare triple {23777#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,966 INFO L273 TraceCheckUtils]: 82: Hoare triple {23778#(<= main_~i~0 19)} assume true; {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,967 INFO L273 TraceCheckUtils]: 83: Hoare triple {23778#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,967 INFO L273 TraceCheckUtils]: 84: Hoare triple {23778#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23778#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:15,968 INFO L273 TraceCheckUtils]: 85: Hoare triple {23778#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,968 INFO L273 TraceCheckUtils]: 86: Hoare triple {23779#(<= main_~i~0 20)} assume true; {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,969 INFO L273 TraceCheckUtils]: 87: Hoare triple {23779#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,969 INFO L273 TraceCheckUtils]: 88: Hoare triple {23779#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23779#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:15,970 INFO L273 TraceCheckUtils]: 89: Hoare triple {23779#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,971 INFO L273 TraceCheckUtils]: 90: Hoare triple {23780#(<= main_~i~0 21)} assume true; {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,971 INFO L273 TraceCheckUtils]: 91: Hoare triple {23780#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,971 INFO L273 TraceCheckUtils]: 92: Hoare triple {23780#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23780#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:15,972 INFO L273 TraceCheckUtils]: 93: Hoare triple {23780#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,973 INFO L273 TraceCheckUtils]: 94: Hoare triple {23781#(<= main_~i~0 22)} assume true; {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,973 INFO L273 TraceCheckUtils]: 95: Hoare triple {23781#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,974 INFO L273 TraceCheckUtils]: 96: Hoare triple {23781#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23781#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:15,974 INFO L273 TraceCheckUtils]: 97: Hoare triple {23781#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,975 INFO L273 TraceCheckUtils]: 98: Hoare triple {23782#(<= main_~i~0 23)} assume true; {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,975 INFO L273 TraceCheckUtils]: 99: Hoare triple {23782#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,976 INFO L273 TraceCheckUtils]: 100: Hoare triple {23782#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23782#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:15,976 INFO L273 TraceCheckUtils]: 101: Hoare triple {23782#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,977 INFO L273 TraceCheckUtils]: 102: Hoare triple {23783#(<= main_~i~0 24)} assume true; {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,977 INFO L273 TraceCheckUtils]: 103: Hoare triple {23783#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,978 INFO L273 TraceCheckUtils]: 104: Hoare triple {23783#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23783#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:15,978 INFO L273 TraceCheckUtils]: 105: Hoare triple {23783#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,979 INFO L273 TraceCheckUtils]: 106: Hoare triple {23784#(<= main_~i~0 25)} assume true; {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,979 INFO L273 TraceCheckUtils]: 107: Hoare triple {23784#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,980 INFO L273 TraceCheckUtils]: 108: Hoare triple {23784#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23784#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:15,980 INFO L273 TraceCheckUtils]: 109: Hoare triple {23784#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,981 INFO L273 TraceCheckUtils]: 110: Hoare triple {23785#(<= main_~i~0 26)} assume true; {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,981 INFO L273 TraceCheckUtils]: 111: Hoare triple {23785#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,982 INFO L273 TraceCheckUtils]: 112: Hoare triple {23785#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23785#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:15,982 INFO L273 TraceCheckUtils]: 113: Hoare triple {23785#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,983 INFO L273 TraceCheckUtils]: 114: Hoare triple {23786#(<= main_~i~0 27)} assume true; {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,983 INFO L273 TraceCheckUtils]: 115: Hoare triple {23786#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,984 INFO L273 TraceCheckUtils]: 116: Hoare triple {23786#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23786#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:15,985 INFO L273 TraceCheckUtils]: 117: Hoare triple {23786#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,985 INFO L273 TraceCheckUtils]: 118: Hoare triple {23787#(<= main_~i~0 28)} assume true; {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,986 INFO L273 TraceCheckUtils]: 119: Hoare triple {23787#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,986 INFO L273 TraceCheckUtils]: 120: Hoare triple {23787#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23787#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:15,987 INFO L273 TraceCheckUtils]: 121: Hoare triple {23787#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,987 INFO L273 TraceCheckUtils]: 122: Hoare triple {23788#(<= main_~i~0 29)} assume true; {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,988 INFO L273 TraceCheckUtils]: 123: Hoare triple {23788#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,988 INFO L273 TraceCheckUtils]: 124: Hoare triple {23788#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23788#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:15,989 INFO L273 TraceCheckUtils]: 125: Hoare triple {23788#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,989 INFO L273 TraceCheckUtils]: 126: Hoare triple {23789#(<= main_~i~0 30)} assume true; {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,990 INFO L273 TraceCheckUtils]: 127: Hoare triple {23789#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,990 INFO L273 TraceCheckUtils]: 128: Hoare triple {23789#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23789#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:15,991 INFO L273 TraceCheckUtils]: 129: Hoare triple {23789#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,991 INFO L273 TraceCheckUtils]: 130: Hoare triple {23790#(<= main_~i~0 31)} assume true; {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,992 INFO L273 TraceCheckUtils]: 131: Hoare triple {23790#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,992 INFO L273 TraceCheckUtils]: 132: Hoare triple {23790#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23790#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:15,993 INFO L273 TraceCheckUtils]: 133: Hoare triple {23790#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,994 INFO L273 TraceCheckUtils]: 134: Hoare triple {23791#(<= main_~i~0 32)} assume true; {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,994 INFO L273 TraceCheckUtils]: 135: Hoare triple {23791#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,994 INFO L273 TraceCheckUtils]: 136: Hoare triple {23791#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23791#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:15,995 INFO L273 TraceCheckUtils]: 137: Hoare triple {23791#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23792#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:15,996 INFO L273 TraceCheckUtils]: 138: Hoare triple {23792#(<= main_~i~0 33)} assume true; {23792#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:15,996 INFO L273 TraceCheckUtils]: 139: Hoare triple {23792#(<= main_~i~0 33)} assume !(~i~0 < 100000); {23758#false} is VALID [2018-11-18 22:58:15,996 INFO L273 TraceCheckUtils]: 140: Hoare triple {23758#false} havoc ~x~0;~x~0 := 0; {23758#false} is VALID [2018-11-18 22:58:15,997 INFO L273 TraceCheckUtils]: 141: Hoare triple {23758#false} assume true; {23758#false} is VALID [2018-11-18 22:58:15,997 INFO L273 TraceCheckUtils]: 142: Hoare triple {23758#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {23758#false} is VALID [2018-11-18 22:58:15,997 INFO L256 TraceCheckUtils]: 143: Hoare triple {23758#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {23758#false} is VALID [2018-11-18 22:58:15,997 INFO L273 TraceCheckUtils]: 144: Hoare triple {23758#false} ~cond := #in~cond; {23758#false} is VALID [2018-11-18 22:58:15,998 INFO L273 TraceCheckUtils]: 145: Hoare triple {23758#false} assume 0 == ~cond; {23758#false} is VALID [2018-11-18 22:58:15,998 INFO L273 TraceCheckUtils]: 146: Hoare triple {23758#false} assume !false; {23758#false} is VALID [2018-11-18 22:58:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:16,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:16,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-18 22:58:16,033 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2018-11-18 22:58:16,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:16,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-18 22:58:16,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:16,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 22:58:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 22:58:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 22:58:16,210 INFO L87 Difference]: Start difference. First operand 158 states and 194 transitions. Second operand 37 states. [2018-11-18 22:58:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:17,148 INFO L93 Difference]: Finished difference Result 182 states and 223 transitions. [2018-11-18 22:58:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 22:58:17,148 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 147 [2018-11-18 22:58:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:58:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 223 transitions. [2018-11-18 22:58:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:58:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 223 transitions. [2018-11-18 22:58:17,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 223 transitions. [2018-11-18 22:58:17,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:17,370 INFO L225 Difference]: With dead ends: 182 [2018-11-18 22:58:17,371 INFO L226 Difference]: Without dead ends: 164 [2018-11-18 22:58:17,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 22:58:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-18 22:58:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-11-18 22:58:17,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:17,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 162 states. [2018-11-18 22:58:17,436 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 162 states. [2018-11-18 22:58:17,436 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 162 states. [2018-11-18 22:58:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:17,438 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2018-11-18 22:58:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2018-11-18 22:58:17,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:17,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:17,439 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 164 states. [2018-11-18 22:58:17,439 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 164 states. [2018-11-18 22:58:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:17,441 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2018-11-18 22:58:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2018-11-18 22:58:17,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:17,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:17,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:17,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-18 22:58:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 199 transitions. [2018-11-18 22:58:17,445 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 199 transitions. Word has length 147 [2018-11-18 22:58:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:17,445 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 199 transitions. [2018-11-18 22:58:17,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 22:58:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 199 transitions. [2018-11-18 22:58:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 22:58:17,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:17,446 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:17,446 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2056591136, now seen corresponding path program 34 times [2018-11-18 22:58:17,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:17,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:18,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {24999#true} call ULTIMATE.init(); {24999#true} is VALID [2018-11-18 22:58:18,238 INFO L273 TraceCheckUtils]: 1: Hoare triple {24999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24999#true} is VALID [2018-11-18 22:58:18,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {24999#true} assume true; {24999#true} is VALID [2018-11-18 22:58:18,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24999#true} {24999#true} #73#return; {24999#true} is VALID [2018-11-18 22:58:18,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {24999#true} call #t~ret7 := main(); {24999#true} is VALID [2018-11-18 22:58:18,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {24999#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {25001#(= main_~i~0 0)} is VALID [2018-11-18 22:58:18,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {25001#(= main_~i~0 0)} assume true; {25001#(= main_~i~0 0)} is VALID [2018-11-18 22:58:18,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {25001#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25001#(= main_~i~0 0)} is VALID [2018-11-18 22:58:18,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {25001#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25001#(= main_~i~0 0)} is VALID [2018-11-18 22:58:18,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {25001#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:18,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {25002#(<= main_~i~0 1)} assume true; {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:18,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {25002#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:18,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {25002#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:18,244 INFO L273 TraceCheckUtils]: 13: Hoare triple {25002#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:18,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {25003#(<= main_~i~0 2)} assume true; {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:18,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {25003#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:18,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {25003#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:18,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {25003#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:18,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {25004#(<= main_~i~0 3)} assume true; {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:18,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {25004#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:18,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {25004#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:18,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {25004#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:18,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {25005#(<= main_~i~0 4)} assume true; {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:18,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {25005#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:18,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {25005#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:18,250 INFO L273 TraceCheckUtils]: 25: Hoare triple {25005#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:18,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {25006#(<= main_~i~0 5)} assume true; {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:18,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {25006#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:18,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {25006#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:18,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {25006#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:18,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {25007#(<= main_~i~0 6)} assume true; {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:18,253 INFO L273 TraceCheckUtils]: 31: Hoare triple {25007#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:18,254 INFO L273 TraceCheckUtils]: 32: Hoare triple {25007#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:18,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {25007#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:18,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {25008#(<= main_~i~0 7)} assume true; {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:18,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {25008#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:18,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {25008#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:18,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {25008#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:18,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {25009#(<= main_~i~0 8)} assume true; {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:18,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {25009#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:18,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {25009#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:18,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {25009#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:18,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {25010#(<= main_~i~0 9)} assume true; {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:18,260 INFO L273 TraceCheckUtils]: 43: Hoare triple {25010#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:18,261 INFO L273 TraceCheckUtils]: 44: Hoare triple {25010#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:18,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {25010#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:18,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {25011#(<= main_~i~0 10)} assume true; {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:18,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {25011#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:18,263 INFO L273 TraceCheckUtils]: 48: Hoare triple {25011#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:18,263 INFO L273 TraceCheckUtils]: 49: Hoare triple {25011#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:18,264 INFO L273 TraceCheckUtils]: 50: Hoare triple {25012#(<= main_~i~0 11)} assume true; {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:18,264 INFO L273 TraceCheckUtils]: 51: Hoare triple {25012#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:18,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {25012#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:18,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {25012#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:18,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {25013#(<= main_~i~0 12)} assume true; {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:18,267 INFO L273 TraceCheckUtils]: 55: Hoare triple {25013#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:18,267 INFO L273 TraceCheckUtils]: 56: Hoare triple {25013#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:18,268 INFO L273 TraceCheckUtils]: 57: Hoare triple {25013#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:18,268 INFO L273 TraceCheckUtils]: 58: Hoare triple {25014#(<= main_~i~0 13)} assume true; {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:18,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {25014#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:18,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {25014#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:18,270 INFO L273 TraceCheckUtils]: 61: Hoare triple {25014#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:18,271 INFO L273 TraceCheckUtils]: 62: Hoare triple {25015#(<= main_~i~0 14)} assume true; {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:18,271 INFO L273 TraceCheckUtils]: 63: Hoare triple {25015#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:18,272 INFO L273 TraceCheckUtils]: 64: Hoare triple {25015#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:18,272 INFO L273 TraceCheckUtils]: 65: Hoare triple {25015#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:18,273 INFO L273 TraceCheckUtils]: 66: Hoare triple {25016#(<= main_~i~0 15)} assume true; {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:18,273 INFO L273 TraceCheckUtils]: 67: Hoare triple {25016#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:18,274 INFO L273 TraceCheckUtils]: 68: Hoare triple {25016#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:18,274 INFO L273 TraceCheckUtils]: 69: Hoare triple {25016#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:18,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {25017#(<= main_~i~0 16)} assume true; {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:18,275 INFO L273 TraceCheckUtils]: 71: Hoare triple {25017#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:18,276 INFO L273 TraceCheckUtils]: 72: Hoare triple {25017#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:18,277 INFO L273 TraceCheckUtils]: 73: Hoare triple {25017#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:18,277 INFO L273 TraceCheckUtils]: 74: Hoare triple {25018#(<= main_~i~0 17)} assume true; {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:18,278 INFO L273 TraceCheckUtils]: 75: Hoare triple {25018#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:18,278 INFO L273 TraceCheckUtils]: 76: Hoare triple {25018#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:18,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {25018#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:18,279 INFO L273 TraceCheckUtils]: 78: Hoare triple {25019#(<= main_~i~0 18)} assume true; {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:18,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {25019#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:18,280 INFO L273 TraceCheckUtils]: 80: Hoare triple {25019#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:18,281 INFO L273 TraceCheckUtils]: 81: Hoare triple {25019#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:18,282 INFO L273 TraceCheckUtils]: 82: Hoare triple {25020#(<= main_~i~0 19)} assume true; {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:18,282 INFO L273 TraceCheckUtils]: 83: Hoare triple {25020#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:18,282 INFO L273 TraceCheckUtils]: 84: Hoare triple {25020#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:18,283 INFO L273 TraceCheckUtils]: 85: Hoare triple {25020#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:18,284 INFO L273 TraceCheckUtils]: 86: Hoare triple {25021#(<= main_~i~0 20)} assume true; {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:18,284 INFO L273 TraceCheckUtils]: 87: Hoare triple {25021#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:18,285 INFO L273 TraceCheckUtils]: 88: Hoare triple {25021#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:18,285 INFO L273 TraceCheckUtils]: 89: Hoare triple {25021#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:18,286 INFO L273 TraceCheckUtils]: 90: Hoare triple {25022#(<= main_~i~0 21)} assume true; {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:18,286 INFO L273 TraceCheckUtils]: 91: Hoare triple {25022#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:18,287 INFO L273 TraceCheckUtils]: 92: Hoare triple {25022#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:18,288 INFO L273 TraceCheckUtils]: 93: Hoare triple {25022#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:18,288 INFO L273 TraceCheckUtils]: 94: Hoare triple {25023#(<= main_~i~0 22)} assume true; {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:18,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {25023#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:18,289 INFO L273 TraceCheckUtils]: 96: Hoare triple {25023#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:18,290 INFO L273 TraceCheckUtils]: 97: Hoare triple {25023#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:18,290 INFO L273 TraceCheckUtils]: 98: Hoare triple {25024#(<= main_~i~0 23)} assume true; {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:18,291 INFO L273 TraceCheckUtils]: 99: Hoare triple {25024#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:18,291 INFO L273 TraceCheckUtils]: 100: Hoare triple {25024#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:18,292 INFO L273 TraceCheckUtils]: 101: Hoare triple {25024#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:18,293 INFO L273 TraceCheckUtils]: 102: Hoare triple {25025#(<= main_~i~0 24)} assume true; {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:18,293 INFO L273 TraceCheckUtils]: 103: Hoare triple {25025#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:18,294 INFO L273 TraceCheckUtils]: 104: Hoare triple {25025#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:18,294 INFO L273 TraceCheckUtils]: 105: Hoare triple {25025#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:18,295 INFO L273 TraceCheckUtils]: 106: Hoare triple {25026#(<= main_~i~0 25)} assume true; {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:18,295 INFO L273 TraceCheckUtils]: 107: Hoare triple {25026#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:18,296 INFO L273 TraceCheckUtils]: 108: Hoare triple {25026#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:18,296 INFO L273 TraceCheckUtils]: 109: Hoare triple {25026#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:18,297 INFO L273 TraceCheckUtils]: 110: Hoare triple {25027#(<= main_~i~0 26)} assume true; {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:18,297 INFO L273 TraceCheckUtils]: 111: Hoare triple {25027#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:18,298 INFO L273 TraceCheckUtils]: 112: Hoare triple {25027#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:18,299 INFO L273 TraceCheckUtils]: 113: Hoare triple {25027#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:18,299 INFO L273 TraceCheckUtils]: 114: Hoare triple {25028#(<= main_~i~0 27)} assume true; {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:18,300 INFO L273 TraceCheckUtils]: 115: Hoare triple {25028#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:18,300 INFO L273 TraceCheckUtils]: 116: Hoare triple {25028#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:18,301 INFO L273 TraceCheckUtils]: 117: Hoare triple {25028#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:18,301 INFO L273 TraceCheckUtils]: 118: Hoare triple {25029#(<= main_~i~0 28)} assume true; {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:18,302 INFO L273 TraceCheckUtils]: 119: Hoare triple {25029#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:18,302 INFO L273 TraceCheckUtils]: 120: Hoare triple {25029#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:18,303 INFO L273 TraceCheckUtils]: 121: Hoare triple {25029#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:18,304 INFO L273 TraceCheckUtils]: 122: Hoare triple {25030#(<= main_~i~0 29)} assume true; {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:18,304 INFO L273 TraceCheckUtils]: 123: Hoare triple {25030#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:18,305 INFO L273 TraceCheckUtils]: 124: Hoare triple {25030#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:18,308 INFO L273 TraceCheckUtils]: 125: Hoare triple {25030#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:18,308 INFO L273 TraceCheckUtils]: 126: Hoare triple {25031#(<= main_~i~0 30)} assume true; {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:18,309 INFO L273 TraceCheckUtils]: 127: Hoare triple {25031#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:18,309 INFO L273 TraceCheckUtils]: 128: Hoare triple {25031#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:18,309 INFO L273 TraceCheckUtils]: 129: Hoare triple {25031#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:18,310 INFO L273 TraceCheckUtils]: 130: Hoare triple {25032#(<= main_~i~0 31)} assume true; {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:18,310 INFO L273 TraceCheckUtils]: 131: Hoare triple {25032#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:18,310 INFO L273 TraceCheckUtils]: 132: Hoare triple {25032#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:18,311 INFO L273 TraceCheckUtils]: 133: Hoare triple {25032#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:18,311 INFO L273 TraceCheckUtils]: 134: Hoare triple {25033#(<= main_~i~0 32)} assume true; {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:18,311 INFO L273 TraceCheckUtils]: 135: Hoare triple {25033#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:18,311 INFO L273 TraceCheckUtils]: 136: Hoare triple {25033#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:18,337 INFO L273 TraceCheckUtils]: 137: Hoare triple {25033#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:18,337 INFO L273 TraceCheckUtils]: 138: Hoare triple {25034#(<= main_~i~0 33)} assume true; {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:18,338 INFO L273 TraceCheckUtils]: 139: Hoare triple {25034#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:18,338 INFO L273 TraceCheckUtils]: 140: Hoare triple {25034#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:18,339 INFO L273 TraceCheckUtils]: 141: Hoare triple {25034#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25035#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:18,339 INFO L273 TraceCheckUtils]: 142: Hoare triple {25035#(<= main_~i~0 34)} assume true; {25035#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:18,339 INFO L273 TraceCheckUtils]: 143: Hoare triple {25035#(<= main_~i~0 34)} assume !(~i~0 < 100000); {25000#false} is VALID [2018-11-18 22:58:18,339 INFO L273 TraceCheckUtils]: 144: Hoare triple {25000#false} havoc ~x~0;~x~0 := 0; {25000#false} is VALID [2018-11-18 22:58:18,340 INFO L273 TraceCheckUtils]: 145: Hoare triple {25000#false} assume true; {25000#false} is VALID [2018-11-18 22:58:18,340 INFO L273 TraceCheckUtils]: 146: Hoare triple {25000#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {25000#false} is VALID [2018-11-18 22:58:18,340 INFO L256 TraceCheckUtils]: 147: Hoare triple {25000#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {25000#false} is VALID [2018-11-18 22:58:18,340 INFO L273 TraceCheckUtils]: 148: Hoare triple {25000#false} ~cond := #in~cond; {25000#false} is VALID [2018-11-18 22:58:18,340 INFO L273 TraceCheckUtils]: 149: Hoare triple {25000#false} assume 0 == ~cond; {25000#false} is VALID [2018-11-18 22:58:18,341 INFO L273 TraceCheckUtils]: 150: Hoare triple {25000#false} assume !false; {25000#false} is VALID [2018-11-18 22:58:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:18,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:18,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:58:19,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:58:19,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:19,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:19,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {24999#true} call ULTIMATE.init(); {24999#true} is VALID [2018-11-18 22:58:19,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {24999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24999#true} is VALID [2018-11-18 22:58:19,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {24999#true} assume true; {24999#true} is VALID [2018-11-18 22:58:19,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24999#true} {24999#true} #73#return; {24999#true} is VALID [2018-11-18 22:58:19,538 INFO L256 TraceCheckUtils]: 4: Hoare triple {24999#true} call #t~ret7 := main(); {24999#true} is VALID [2018-11-18 22:58:19,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {24999#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {25054#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:19,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {25054#(<= main_~i~0 0)} assume true; {25054#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:19,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {25054#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25054#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:19,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {25054#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25054#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:19,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {25054#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {25002#(<= main_~i~0 1)} assume true; {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {25002#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {25002#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25002#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:19,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {25002#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {25003#(<= main_~i~0 2)} assume true; {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {25003#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {25003#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25003#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:19,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {25003#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {25004#(<= main_~i~0 3)} assume true; {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {25004#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {25004#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25004#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:19,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {25004#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {25005#(<= main_~i~0 4)} assume true; {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {25005#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {25005#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25005#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:19,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {25005#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {25006#(<= main_~i~0 5)} assume true; {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {25006#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {25006#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25006#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:19,551 INFO L273 TraceCheckUtils]: 29: Hoare triple {25006#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {25007#(<= main_~i~0 6)} assume true; {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {25007#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {25007#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25007#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:19,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {25007#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {25008#(<= main_~i~0 7)} assume true; {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {25008#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,554 INFO L273 TraceCheckUtils]: 36: Hoare triple {25008#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25008#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:19,555 INFO L273 TraceCheckUtils]: 37: Hoare triple {25008#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,556 INFO L273 TraceCheckUtils]: 38: Hoare triple {25009#(<= main_~i~0 8)} assume true; {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {25009#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,557 INFO L273 TraceCheckUtils]: 40: Hoare triple {25009#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25009#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:19,557 INFO L273 TraceCheckUtils]: 41: Hoare triple {25009#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,558 INFO L273 TraceCheckUtils]: 42: Hoare triple {25010#(<= main_~i~0 9)} assume true; {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {25010#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {25010#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25010#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:19,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {25010#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,560 INFO L273 TraceCheckUtils]: 46: Hoare triple {25011#(<= main_~i~0 10)} assume true; {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,561 INFO L273 TraceCheckUtils]: 47: Hoare triple {25011#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,561 INFO L273 TraceCheckUtils]: 48: Hoare triple {25011#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25011#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:19,562 INFO L273 TraceCheckUtils]: 49: Hoare triple {25011#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,562 INFO L273 TraceCheckUtils]: 50: Hoare triple {25012#(<= main_~i~0 11)} assume true; {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {25012#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,563 INFO L273 TraceCheckUtils]: 52: Hoare triple {25012#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25012#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:19,564 INFO L273 TraceCheckUtils]: 53: Hoare triple {25012#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,565 INFO L273 TraceCheckUtils]: 54: Hoare triple {25013#(<= main_~i~0 12)} assume true; {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,565 INFO L273 TraceCheckUtils]: 55: Hoare triple {25013#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {25013#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25013#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:19,566 INFO L273 TraceCheckUtils]: 57: Hoare triple {25013#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {25014#(<= main_~i~0 13)} assume true; {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {25014#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {25014#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25014#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:19,568 INFO L273 TraceCheckUtils]: 61: Hoare triple {25014#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,569 INFO L273 TraceCheckUtils]: 62: Hoare triple {25015#(<= main_~i~0 14)} assume true; {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,569 INFO L273 TraceCheckUtils]: 63: Hoare triple {25015#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,570 INFO L273 TraceCheckUtils]: 64: Hoare triple {25015#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25015#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:19,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {25015#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,571 INFO L273 TraceCheckUtils]: 66: Hoare triple {25016#(<= main_~i~0 15)} assume true; {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,572 INFO L273 TraceCheckUtils]: 67: Hoare triple {25016#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,572 INFO L273 TraceCheckUtils]: 68: Hoare triple {25016#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25016#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:19,573 INFO L273 TraceCheckUtils]: 69: Hoare triple {25016#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,573 INFO L273 TraceCheckUtils]: 70: Hoare triple {25017#(<= main_~i~0 16)} assume true; {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {25017#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {25017#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25017#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:19,575 INFO L273 TraceCheckUtils]: 73: Hoare triple {25017#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,576 INFO L273 TraceCheckUtils]: 74: Hoare triple {25018#(<= main_~i~0 17)} assume true; {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,576 INFO L273 TraceCheckUtils]: 75: Hoare triple {25018#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,577 INFO L273 TraceCheckUtils]: 76: Hoare triple {25018#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25018#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:19,577 INFO L273 TraceCheckUtils]: 77: Hoare triple {25018#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,578 INFO L273 TraceCheckUtils]: 78: Hoare triple {25019#(<= main_~i~0 18)} assume true; {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,578 INFO L273 TraceCheckUtils]: 79: Hoare triple {25019#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,579 INFO L273 TraceCheckUtils]: 80: Hoare triple {25019#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25019#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:19,579 INFO L273 TraceCheckUtils]: 81: Hoare triple {25019#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {25020#(<= main_~i~0 19)} assume true; {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,580 INFO L273 TraceCheckUtils]: 83: Hoare triple {25020#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,581 INFO L273 TraceCheckUtils]: 84: Hoare triple {25020#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25020#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:19,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {25020#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,582 INFO L273 TraceCheckUtils]: 86: Hoare triple {25021#(<= main_~i~0 20)} assume true; {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,583 INFO L273 TraceCheckUtils]: 87: Hoare triple {25021#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,583 INFO L273 TraceCheckUtils]: 88: Hoare triple {25021#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25021#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:19,584 INFO L273 TraceCheckUtils]: 89: Hoare triple {25021#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,584 INFO L273 TraceCheckUtils]: 90: Hoare triple {25022#(<= main_~i~0 21)} assume true; {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,585 INFO L273 TraceCheckUtils]: 91: Hoare triple {25022#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,585 INFO L273 TraceCheckUtils]: 92: Hoare triple {25022#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25022#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:19,586 INFO L273 TraceCheckUtils]: 93: Hoare triple {25022#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {25023#(<= main_~i~0 22)} assume true; {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,587 INFO L273 TraceCheckUtils]: 95: Hoare triple {25023#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,588 INFO L273 TraceCheckUtils]: 96: Hoare triple {25023#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25023#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:19,588 INFO L273 TraceCheckUtils]: 97: Hoare triple {25023#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,589 INFO L273 TraceCheckUtils]: 98: Hoare triple {25024#(<= main_~i~0 23)} assume true; {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,589 INFO L273 TraceCheckUtils]: 99: Hoare triple {25024#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,590 INFO L273 TraceCheckUtils]: 100: Hoare triple {25024#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25024#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:19,591 INFO L273 TraceCheckUtils]: 101: Hoare triple {25024#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,591 INFO L273 TraceCheckUtils]: 102: Hoare triple {25025#(<= main_~i~0 24)} assume true; {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,592 INFO L273 TraceCheckUtils]: 103: Hoare triple {25025#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,592 INFO L273 TraceCheckUtils]: 104: Hoare triple {25025#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25025#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:19,593 INFO L273 TraceCheckUtils]: 105: Hoare triple {25025#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,593 INFO L273 TraceCheckUtils]: 106: Hoare triple {25026#(<= main_~i~0 25)} assume true; {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,594 INFO L273 TraceCheckUtils]: 107: Hoare triple {25026#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,594 INFO L273 TraceCheckUtils]: 108: Hoare triple {25026#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25026#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:19,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {25026#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,595 INFO L273 TraceCheckUtils]: 110: Hoare triple {25027#(<= main_~i~0 26)} assume true; {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,596 INFO L273 TraceCheckUtils]: 111: Hoare triple {25027#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,596 INFO L273 TraceCheckUtils]: 112: Hoare triple {25027#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25027#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:19,597 INFO L273 TraceCheckUtils]: 113: Hoare triple {25027#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,598 INFO L273 TraceCheckUtils]: 114: Hoare triple {25028#(<= main_~i~0 27)} assume true; {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,598 INFO L273 TraceCheckUtils]: 115: Hoare triple {25028#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,599 INFO L273 TraceCheckUtils]: 116: Hoare triple {25028#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25028#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:19,599 INFO L273 TraceCheckUtils]: 117: Hoare triple {25028#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,600 INFO L273 TraceCheckUtils]: 118: Hoare triple {25029#(<= main_~i~0 28)} assume true; {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,600 INFO L273 TraceCheckUtils]: 119: Hoare triple {25029#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,601 INFO L273 TraceCheckUtils]: 120: Hoare triple {25029#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25029#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:19,601 INFO L273 TraceCheckUtils]: 121: Hoare triple {25029#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,602 INFO L273 TraceCheckUtils]: 122: Hoare triple {25030#(<= main_~i~0 29)} assume true; {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,602 INFO L273 TraceCheckUtils]: 123: Hoare triple {25030#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,603 INFO L273 TraceCheckUtils]: 124: Hoare triple {25030#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25030#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:19,604 INFO L273 TraceCheckUtils]: 125: Hoare triple {25030#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,604 INFO L273 TraceCheckUtils]: 126: Hoare triple {25031#(<= main_~i~0 30)} assume true; {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,605 INFO L273 TraceCheckUtils]: 127: Hoare triple {25031#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,605 INFO L273 TraceCheckUtils]: 128: Hoare triple {25031#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25031#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:19,606 INFO L273 TraceCheckUtils]: 129: Hoare triple {25031#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,606 INFO L273 TraceCheckUtils]: 130: Hoare triple {25032#(<= main_~i~0 31)} assume true; {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,607 INFO L273 TraceCheckUtils]: 131: Hoare triple {25032#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,607 INFO L273 TraceCheckUtils]: 132: Hoare triple {25032#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25032#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:19,608 INFO L273 TraceCheckUtils]: 133: Hoare triple {25032#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,609 INFO L273 TraceCheckUtils]: 134: Hoare triple {25033#(<= main_~i~0 32)} assume true; {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,609 INFO L273 TraceCheckUtils]: 135: Hoare triple {25033#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,610 INFO L273 TraceCheckUtils]: 136: Hoare triple {25033#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25033#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:19,610 INFO L273 TraceCheckUtils]: 137: Hoare triple {25033#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,611 INFO L273 TraceCheckUtils]: 138: Hoare triple {25034#(<= main_~i~0 33)} assume true; {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,611 INFO L273 TraceCheckUtils]: 139: Hoare triple {25034#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,612 INFO L273 TraceCheckUtils]: 140: Hoare triple {25034#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25034#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:19,612 INFO L273 TraceCheckUtils]: 141: Hoare triple {25034#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25035#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:19,613 INFO L273 TraceCheckUtils]: 142: Hoare triple {25035#(<= main_~i~0 34)} assume true; {25035#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:19,613 INFO L273 TraceCheckUtils]: 143: Hoare triple {25035#(<= main_~i~0 34)} assume !(~i~0 < 100000); {25000#false} is VALID [2018-11-18 22:58:19,614 INFO L273 TraceCheckUtils]: 144: Hoare triple {25000#false} havoc ~x~0;~x~0 := 0; {25000#false} is VALID [2018-11-18 22:58:19,614 INFO L273 TraceCheckUtils]: 145: Hoare triple {25000#false} assume true; {25000#false} is VALID [2018-11-18 22:58:19,614 INFO L273 TraceCheckUtils]: 146: Hoare triple {25000#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {25000#false} is VALID [2018-11-18 22:58:19,614 INFO L256 TraceCheckUtils]: 147: Hoare triple {25000#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {25000#false} is VALID [2018-11-18 22:58:19,614 INFO L273 TraceCheckUtils]: 148: Hoare triple {25000#false} ~cond := #in~cond; {25000#false} is VALID [2018-11-18 22:58:19,614 INFO L273 TraceCheckUtils]: 149: Hoare triple {25000#false} assume 0 == ~cond; {25000#false} is VALID [2018-11-18 22:58:19,615 INFO L273 TraceCheckUtils]: 150: Hoare triple {25000#false} assume !false; {25000#false} is VALID [2018-11-18 22:58:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:19,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:19,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-18 22:58:19,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-18 22:58:19,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:19,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-18 22:58:19,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:19,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 22:58:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 22:58:19,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:58:19,799 INFO L87 Difference]: Start difference. First operand 162 states and 199 transitions. Second operand 38 states. [2018-11-18 22:58:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:20,384 INFO L93 Difference]: Finished difference Result 186 states and 228 transitions. [2018-11-18 22:58:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 22:58:20,384 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-11-18 22:58:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:58:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 228 transitions. [2018-11-18 22:58:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 22:58:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 228 transitions. [2018-11-18 22:58:20,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 228 transitions. [2018-11-18 22:58:20,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:20,587 INFO L225 Difference]: With dead ends: 186 [2018-11-18 22:58:20,588 INFO L226 Difference]: Without dead ends: 168 [2018-11-18 22:58:20,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 22:58:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-18 22:58:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-11-18 22:58:20,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:20,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 166 states. [2018-11-18 22:58:20,619 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 166 states. [2018-11-18 22:58:20,619 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 166 states. [2018-11-18 22:58:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:20,622 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2018-11-18 22:58:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2018-11-18 22:58:20,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:20,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:20,623 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 168 states. [2018-11-18 22:58:20,623 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 168 states. [2018-11-18 22:58:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:20,625 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2018-11-18 22:58:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2018-11-18 22:58:20,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:20,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:20,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:20,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 22:58:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 204 transitions. [2018-11-18 22:58:20,628 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 204 transitions. Word has length 151 [2018-11-18 22:58:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 204 transitions. [2018-11-18 22:58:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 22:58:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 204 transitions. [2018-11-18 22:58:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 22:58:20,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:20,629 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:20,629 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:20,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash 927607799, now seen corresponding path program 35 times [2018-11-18 22:58:20,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:20,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:21,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {26272#true} call ULTIMATE.init(); {26272#true} is VALID [2018-11-18 22:58:21,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {26272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26272#true} is VALID [2018-11-18 22:58:21,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {26272#true} assume true; {26272#true} is VALID [2018-11-18 22:58:21,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26272#true} {26272#true} #73#return; {26272#true} is VALID [2018-11-18 22:58:21,432 INFO L256 TraceCheckUtils]: 4: Hoare triple {26272#true} call #t~ret7 := main(); {26272#true} is VALID [2018-11-18 22:58:21,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {26272#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {26274#(= main_~i~0 0)} is VALID [2018-11-18 22:58:21,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {26274#(= main_~i~0 0)} assume true; {26274#(= main_~i~0 0)} is VALID [2018-11-18 22:58:21,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {26274#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26274#(= main_~i~0 0)} is VALID [2018-11-18 22:58:21,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {26274#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26274#(= main_~i~0 0)} is VALID [2018-11-18 22:58:21,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {26274#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:21,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {26275#(<= main_~i~0 1)} assume true; {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:21,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {26275#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:21,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {26275#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:21,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {26275#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:21,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {26276#(<= main_~i~0 2)} assume true; {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:21,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {26276#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:21,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {26276#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:21,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {26276#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:21,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {26277#(<= main_~i~0 3)} assume true; {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:21,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {26277#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:21,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {26277#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:21,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {26277#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:21,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {26278#(<= main_~i~0 4)} assume true; {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:21,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {26278#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:21,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {26278#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:21,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {26278#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:21,443 INFO L273 TraceCheckUtils]: 26: Hoare triple {26279#(<= main_~i~0 5)} assume true; {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:21,444 INFO L273 TraceCheckUtils]: 27: Hoare triple {26279#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:21,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {26279#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:21,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {26279#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:21,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {26280#(<= main_~i~0 6)} assume true; {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:21,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {26280#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:21,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {26280#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:21,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {26280#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:21,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {26281#(<= main_~i~0 7)} assume true; {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:21,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {26281#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:21,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {26281#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:21,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {26281#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:21,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {26282#(<= main_~i~0 8)} assume true; {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:21,450 INFO L273 TraceCheckUtils]: 39: Hoare triple {26282#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:21,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {26282#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:21,451 INFO L273 TraceCheckUtils]: 41: Hoare triple {26282#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:21,452 INFO L273 TraceCheckUtils]: 42: Hoare triple {26283#(<= main_~i~0 9)} assume true; {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:21,452 INFO L273 TraceCheckUtils]: 43: Hoare triple {26283#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:21,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {26283#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:21,453 INFO L273 TraceCheckUtils]: 45: Hoare triple {26283#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:21,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {26284#(<= main_~i~0 10)} assume true; {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:21,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {26284#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:21,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {26284#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:21,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {26284#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:21,456 INFO L273 TraceCheckUtils]: 50: Hoare triple {26285#(<= main_~i~0 11)} assume true; {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:21,456 INFO L273 TraceCheckUtils]: 51: Hoare triple {26285#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:21,457 INFO L273 TraceCheckUtils]: 52: Hoare triple {26285#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:21,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {26285#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:21,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {26286#(<= main_~i~0 12)} assume true; {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:21,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {26286#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:21,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {26286#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:21,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {26286#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:21,460 INFO L273 TraceCheckUtils]: 58: Hoare triple {26287#(<= main_~i~0 13)} assume true; {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:21,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {26287#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:21,461 INFO L273 TraceCheckUtils]: 60: Hoare triple {26287#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:21,461 INFO L273 TraceCheckUtils]: 61: Hoare triple {26287#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:21,462 INFO L273 TraceCheckUtils]: 62: Hoare triple {26288#(<= main_~i~0 14)} assume true; {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:21,462 INFO L273 TraceCheckUtils]: 63: Hoare triple {26288#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:21,463 INFO L273 TraceCheckUtils]: 64: Hoare triple {26288#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:21,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {26288#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:21,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {26289#(<= main_~i~0 15)} assume true; {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:21,464 INFO L273 TraceCheckUtils]: 67: Hoare triple {26289#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:21,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {26289#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:21,465 INFO L273 TraceCheckUtils]: 69: Hoare triple {26289#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:21,466 INFO L273 TraceCheckUtils]: 70: Hoare triple {26290#(<= main_~i~0 16)} assume true; {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:21,466 INFO L273 TraceCheckUtils]: 71: Hoare triple {26290#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:21,467 INFO L273 TraceCheckUtils]: 72: Hoare triple {26290#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:21,467 INFO L273 TraceCheckUtils]: 73: Hoare triple {26290#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:21,468 INFO L273 TraceCheckUtils]: 74: Hoare triple {26291#(<= main_~i~0 17)} assume true; {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:21,468 INFO L273 TraceCheckUtils]: 75: Hoare triple {26291#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:21,469 INFO L273 TraceCheckUtils]: 76: Hoare triple {26291#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:21,470 INFO L273 TraceCheckUtils]: 77: Hoare triple {26291#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:21,470 INFO L273 TraceCheckUtils]: 78: Hoare triple {26292#(<= main_~i~0 18)} assume true; {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:21,470 INFO L273 TraceCheckUtils]: 79: Hoare triple {26292#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:21,471 INFO L273 TraceCheckUtils]: 80: Hoare triple {26292#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:21,472 INFO L273 TraceCheckUtils]: 81: Hoare triple {26292#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:21,472 INFO L273 TraceCheckUtils]: 82: Hoare triple {26293#(<= main_~i~0 19)} assume true; {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:21,473 INFO L273 TraceCheckUtils]: 83: Hoare triple {26293#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:21,473 INFO L273 TraceCheckUtils]: 84: Hoare triple {26293#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:21,474 INFO L273 TraceCheckUtils]: 85: Hoare triple {26293#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:21,474 INFO L273 TraceCheckUtils]: 86: Hoare triple {26294#(<= main_~i~0 20)} assume true; {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:21,475 INFO L273 TraceCheckUtils]: 87: Hoare triple {26294#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:21,475 INFO L273 TraceCheckUtils]: 88: Hoare triple {26294#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:21,476 INFO L273 TraceCheckUtils]: 89: Hoare triple {26294#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:21,476 INFO L273 TraceCheckUtils]: 90: Hoare triple {26295#(<= main_~i~0 21)} assume true; {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:21,477 INFO L273 TraceCheckUtils]: 91: Hoare triple {26295#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:21,477 INFO L273 TraceCheckUtils]: 92: Hoare triple {26295#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:21,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {26295#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:21,478 INFO L273 TraceCheckUtils]: 94: Hoare triple {26296#(<= main_~i~0 22)} assume true; {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:21,479 INFO L273 TraceCheckUtils]: 95: Hoare triple {26296#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:21,479 INFO L273 TraceCheckUtils]: 96: Hoare triple {26296#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:21,480 INFO L273 TraceCheckUtils]: 97: Hoare triple {26296#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:21,480 INFO L273 TraceCheckUtils]: 98: Hoare triple {26297#(<= main_~i~0 23)} assume true; {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:21,481 INFO L273 TraceCheckUtils]: 99: Hoare triple {26297#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:21,481 INFO L273 TraceCheckUtils]: 100: Hoare triple {26297#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:21,482 INFO L273 TraceCheckUtils]: 101: Hoare triple {26297#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:21,482 INFO L273 TraceCheckUtils]: 102: Hoare triple {26298#(<= main_~i~0 24)} assume true; {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:21,483 INFO L273 TraceCheckUtils]: 103: Hoare triple {26298#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:21,483 INFO L273 TraceCheckUtils]: 104: Hoare triple {26298#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:21,484 INFO L273 TraceCheckUtils]: 105: Hoare triple {26298#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:21,484 INFO L273 TraceCheckUtils]: 106: Hoare triple {26299#(<= main_~i~0 25)} assume true; {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:21,485 INFO L273 TraceCheckUtils]: 107: Hoare triple {26299#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:21,485 INFO L273 TraceCheckUtils]: 108: Hoare triple {26299#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:21,486 INFO L273 TraceCheckUtils]: 109: Hoare triple {26299#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:21,486 INFO L273 TraceCheckUtils]: 110: Hoare triple {26300#(<= main_~i~0 26)} assume true; {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:21,487 INFO L273 TraceCheckUtils]: 111: Hoare triple {26300#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:21,487 INFO L273 TraceCheckUtils]: 112: Hoare triple {26300#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:21,488 INFO L273 TraceCheckUtils]: 113: Hoare triple {26300#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:21,489 INFO L273 TraceCheckUtils]: 114: Hoare triple {26301#(<= main_~i~0 27)} assume true; {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:21,489 INFO L273 TraceCheckUtils]: 115: Hoare triple {26301#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:21,489 INFO L273 TraceCheckUtils]: 116: Hoare triple {26301#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:21,490 INFO L273 TraceCheckUtils]: 117: Hoare triple {26301#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:21,491 INFO L273 TraceCheckUtils]: 118: Hoare triple {26302#(<= main_~i~0 28)} assume true; {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:21,491 INFO L273 TraceCheckUtils]: 119: Hoare triple {26302#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:21,492 INFO L273 TraceCheckUtils]: 120: Hoare triple {26302#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:21,492 INFO L273 TraceCheckUtils]: 121: Hoare triple {26302#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:21,493 INFO L273 TraceCheckUtils]: 122: Hoare triple {26303#(<= main_~i~0 29)} assume true; {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:21,493 INFO L273 TraceCheckUtils]: 123: Hoare triple {26303#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:21,494 INFO L273 TraceCheckUtils]: 124: Hoare triple {26303#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:21,494 INFO L273 TraceCheckUtils]: 125: Hoare triple {26303#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:21,495 INFO L273 TraceCheckUtils]: 126: Hoare triple {26304#(<= main_~i~0 30)} assume true; {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:21,495 INFO L273 TraceCheckUtils]: 127: Hoare triple {26304#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:21,496 INFO L273 TraceCheckUtils]: 128: Hoare triple {26304#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:21,496 INFO L273 TraceCheckUtils]: 129: Hoare triple {26304#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:21,497 INFO L273 TraceCheckUtils]: 130: Hoare triple {26305#(<= main_~i~0 31)} assume true; {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:21,497 INFO L273 TraceCheckUtils]: 131: Hoare triple {26305#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:21,498 INFO L273 TraceCheckUtils]: 132: Hoare triple {26305#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:21,498 INFO L273 TraceCheckUtils]: 133: Hoare triple {26305#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:21,499 INFO L273 TraceCheckUtils]: 134: Hoare triple {26306#(<= main_~i~0 32)} assume true; {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:21,499 INFO L273 TraceCheckUtils]: 135: Hoare triple {26306#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:21,500 INFO L273 TraceCheckUtils]: 136: Hoare triple {26306#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:21,500 INFO L273 TraceCheckUtils]: 137: Hoare triple {26306#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:21,501 INFO L273 TraceCheckUtils]: 138: Hoare triple {26307#(<= main_~i~0 33)} assume true; {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:21,501 INFO L273 TraceCheckUtils]: 139: Hoare triple {26307#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:21,502 INFO L273 TraceCheckUtils]: 140: Hoare triple {26307#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:21,503 INFO L273 TraceCheckUtils]: 141: Hoare triple {26307#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:21,503 INFO L273 TraceCheckUtils]: 142: Hoare triple {26308#(<= main_~i~0 34)} assume true; {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:21,504 INFO L273 TraceCheckUtils]: 143: Hoare triple {26308#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:21,504 INFO L273 TraceCheckUtils]: 144: Hoare triple {26308#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:21,505 INFO L273 TraceCheckUtils]: 145: Hoare triple {26308#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26309#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:21,505 INFO L273 TraceCheckUtils]: 146: Hoare triple {26309#(<= main_~i~0 35)} assume true; {26309#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:21,506 INFO L273 TraceCheckUtils]: 147: Hoare triple {26309#(<= main_~i~0 35)} assume !(~i~0 < 100000); {26273#false} is VALID [2018-11-18 22:58:21,506 INFO L273 TraceCheckUtils]: 148: Hoare triple {26273#false} havoc ~x~0;~x~0 := 0; {26273#false} is VALID [2018-11-18 22:58:21,506 INFO L273 TraceCheckUtils]: 149: Hoare triple {26273#false} assume true; {26273#false} is VALID [2018-11-18 22:58:21,506 INFO L273 TraceCheckUtils]: 150: Hoare triple {26273#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {26273#false} is VALID [2018-11-18 22:58:21,506 INFO L256 TraceCheckUtils]: 151: Hoare triple {26273#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {26273#false} is VALID [2018-11-18 22:58:21,507 INFO L273 TraceCheckUtils]: 152: Hoare triple {26273#false} ~cond := #in~cond; {26273#false} is VALID [2018-11-18 22:58:21,507 INFO L273 TraceCheckUtils]: 153: Hoare triple {26273#false} assume 0 == ~cond; {26273#false} is VALID [2018-11-18 22:58:21,507 INFO L273 TraceCheckUtils]: 154: Hoare triple {26273#false} assume !false; {26273#false} is VALID [2018-11-18 22:58:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:21,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:21,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:21,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:58:23,237 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-18 22:58:23,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:58:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:23,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:58:23,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {26272#true} call ULTIMATE.init(); {26272#true} is VALID [2018-11-18 22:58:23,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {26272#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26272#true} is VALID [2018-11-18 22:58:23,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {26272#true} assume true; {26272#true} is VALID [2018-11-18 22:58:23,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26272#true} {26272#true} #73#return; {26272#true} is VALID [2018-11-18 22:58:23,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {26272#true} call #t~ret7 := main(); {26272#true} is VALID [2018-11-18 22:58:23,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {26272#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {26328#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {26328#(<= main_~i~0 0)} assume true; {26328#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {26328#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26328#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {26328#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26328#(<= main_~i~0 0)} is VALID [2018-11-18 22:58:23,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {26328#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {26275#(<= main_~i~0 1)} assume true; {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {26275#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {26275#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26275#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:23,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {26275#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {26276#(<= main_~i~0 2)} assume true; {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {26276#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {26276#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26276#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:23,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {26276#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {26277#(<= main_~i~0 3)} assume true; {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {26277#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {26277#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26277#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:23,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {26277#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {26278#(<= main_~i~0 4)} assume true; {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {26278#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {26278#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26278#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:23,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {26278#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {26279#(<= main_~i~0 5)} assume true; {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {26279#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {26279#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26279#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:23,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {26279#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {26280#(<= main_~i~0 6)} assume true; {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,558 INFO L273 TraceCheckUtils]: 31: Hoare triple {26280#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,558 INFO L273 TraceCheckUtils]: 32: Hoare triple {26280#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26280#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:23,559 INFO L273 TraceCheckUtils]: 33: Hoare triple {26280#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {26281#(<= main_~i~0 7)} assume true; {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,560 INFO L273 TraceCheckUtils]: 35: Hoare triple {26281#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {26281#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26281#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:23,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {26281#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {26282#(<= main_~i~0 8)} assume true; {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,562 INFO L273 TraceCheckUtils]: 39: Hoare triple {26282#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,562 INFO L273 TraceCheckUtils]: 40: Hoare triple {26282#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26282#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:23,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {26282#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {26283#(<= main_~i~0 9)} assume true; {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {26283#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {26283#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26283#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:23,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {26283#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {26284#(<= main_~i~0 10)} assume true; {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,566 INFO L273 TraceCheckUtils]: 47: Hoare triple {26284#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {26284#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26284#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:23,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {26284#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {26285#(<= main_~i~0 11)} assume true; {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {26285#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {26285#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26285#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:23,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {26285#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {26286#(<= main_~i~0 12)} assume true; {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {26286#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,570 INFO L273 TraceCheckUtils]: 56: Hoare triple {26286#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26286#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:23,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {26286#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,572 INFO L273 TraceCheckUtils]: 58: Hoare triple {26287#(<= main_~i~0 13)} assume true; {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,572 INFO L273 TraceCheckUtils]: 59: Hoare triple {26287#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {26287#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26287#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:23,573 INFO L273 TraceCheckUtils]: 61: Hoare triple {26287#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,574 INFO L273 TraceCheckUtils]: 62: Hoare triple {26288#(<= main_~i~0 14)} assume true; {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {26288#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,575 INFO L273 TraceCheckUtils]: 64: Hoare triple {26288#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26288#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:23,575 INFO L273 TraceCheckUtils]: 65: Hoare triple {26288#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,576 INFO L273 TraceCheckUtils]: 66: Hoare triple {26289#(<= main_~i~0 15)} assume true; {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,576 INFO L273 TraceCheckUtils]: 67: Hoare triple {26289#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,577 INFO L273 TraceCheckUtils]: 68: Hoare triple {26289#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26289#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:23,577 INFO L273 TraceCheckUtils]: 69: Hoare triple {26289#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {26290#(<= main_~i~0 16)} assume true; {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {26290#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {26290#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26290#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:23,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {26290#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,580 INFO L273 TraceCheckUtils]: 74: Hoare triple {26291#(<= main_~i~0 17)} assume true; {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,580 INFO L273 TraceCheckUtils]: 75: Hoare triple {26291#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,581 INFO L273 TraceCheckUtils]: 76: Hoare triple {26291#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26291#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:23,581 INFO L273 TraceCheckUtils]: 77: Hoare triple {26291#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,582 INFO L273 TraceCheckUtils]: 78: Hoare triple {26292#(<= main_~i~0 18)} assume true; {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {26292#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,583 INFO L273 TraceCheckUtils]: 80: Hoare triple {26292#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26292#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:23,584 INFO L273 TraceCheckUtils]: 81: Hoare triple {26292#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,584 INFO L273 TraceCheckUtils]: 82: Hoare triple {26293#(<= main_~i~0 19)} assume true; {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,584 INFO L273 TraceCheckUtils]: 83: Hoare triple {26293#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,585 INFO L273 TraceCheckUtils]: 84: Hoare triple {26293#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26293#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:23,586 INFO L273 TraceCheckUtils]: 85: Hoare triple {26293#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {26294#(<= main_~i~0 20)} assume true; {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,587 INFO L273 TraceCheckUtils]: 87: Hoare triple {26294#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,587 INFO L273 TraceCheckUtils]: 88: Hoare triple {26294#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26294#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:23,588 INFO L273 TraceCheckUtils]: 89: Hoare triple {26294#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,588 INFO L273 TraceCheckUtils]: 90: Hoare triple {26295#(<= main_~i~0 21)} assume true; {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,589 INFO L273 TraceCheckUtils]: 91: Hoare triple {26295#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,589 INFO L273 TraceCheckUtils]: 92: Hoare triple {26295#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26295#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:23,590 INFO L273 TraceCheckUtils]: 93: Hoare triple {26295#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,590 INFO L273 TraceCheckUtils]: 94: Hoare triple {26296#(<= main_~i~0 22)} assume true; {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,591 INFO L273 TraceCheckUtils]: 95: Hoare triple {26296#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,591 INFO L273 TraceCheckUtils]: 96: Hoare triple {26296#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26296#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:23,592 INFO L273 TraceCheckUtils]: 97: Hoare triple {26296#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,592 INFO L273 TraceCheckUtils]: 98: Hoare triple {26297#(<= main_~i~0 23)} assume true; {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,593 INFO L273 TraceCheckUtils]: 99: Hoare triple {26297#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,593 INFO L273 TraceCheckUtils]: 100: Hoare triple {26297#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26297#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:23,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {26297#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,595 INFO L273 TraceCheckUtils]: 102: Hoare triple {26298#(<= main_~i~0 24)} assume true; {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,595 INFO L273 TraceCheckUtils]: 103: Hoare triple {26298#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,595 INFO L273 TraceCheckUtils]: 104: Hoare triple {26298#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26298#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:23,596 INFO L273 TraceCheckUtils]: 105: Hoare triple {26298#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,597 INFO L273 TraceCheckUtils]: 106: Hoare triple {26299#(<= main_~i~0 25)} assume true; {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,597 INFO L273 TraceCheckUtils]: 107: Hoare triple {26299#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,597 INFO L273 TraceCheckUtils]: 108: Hoare triple {26299#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26299#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:23,598 INFO L273 TraceCheckUtils]: 109: Hoare triple {26299#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,599 INFO L273 TraceCheckUtils]: 110: Hoare triple {26300#(<= main_~i~0 26)} assume true; {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,599 INFO L273 TraceCheckUtils]: 111: Hoare triple {26300#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,600 INFO L273 TraceCheckUtils]: 112: Hoare triple {26300#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26300#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:23,600 INFO L273 TraceCheckUtils]: 113: Hoare triple {26300#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,601 INFO L273 TraceCheckUtils]: 114: Hoare triple {26301#(<= main_~i~0 27)} assume true; {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,601 INFO L273 TraceCheckUtils]: 115: Hoare triple {26301#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {26301#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26301#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:23,602 INFO L273 TraceCheckUtils]: 117: Hoare triple {26301#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,603 INFO L273 TraceCheckUtils]: 118: Hoare triple {26302#(<= main_~i~0 28)} assume true; {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,603 INFO L273 TraceCheckUtils]: 119: Hoare triple {26302#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,604 INFO L273 TraceCheckUtils]: 120: Hoare triple {26302#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26302#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:23,604 INFO L273 TraceCheckUtils]: 121: Hoare triple {26302#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,605 INFO L273 TraceCheckUtils]: 122: Hoare triple {26303#(<= main_~i~0 29)} assume true; {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,605 INFO L273 TraceCheckUtils]: 123: Hoare triple {26303#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,606 INFO L273 TraceCheckUtils]: 124: Hoare triple {26303#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26303#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:23,606 INFO L273 TraceCheckUtils]: 125: Hoare triple {26303#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,607 INFO L273 TraceCheckUtils]: 126: Hoare triple {26304#(<= main_~i~0 30)} assume true; {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,607 INFO L273 TraceCheckUtils]: 127: Hoare triple {26304#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,608 INFO L273 TraceCheckUtils]: 128: Hoare triple {26304#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26304#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:23,609 INFO L273 TraceCheckUtils]: 129: Hoare triple {26304#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,609 INFO L273 TraceCheckUtils]: 130: Hoare triple {26305#(<= main_~i~0 31)} assume true; {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,609 INFO L273 TraceCheckUtils]: 131: Hoare triple {26305#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,610 INFO L273 TraceCheckUtils]: 132: Hoare triple {26305#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26305#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:23,611 INFO L273 TraceCheckUtils]: 133: Hoare triple {26305#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,611 INFO L273 TraceCheckUtils]: 134: Hoare triple {26306#(<= main_~i~0 32)} assume true; {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,612 INFO L273 TraceCheckUtils]: 135: Hoare triple {26306#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,612 INFO L273 TraceCheckUtils]: 136: Hoare triple {26306#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26306#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:23,613 INFO L273 TraceCheckUtils]: 137: Hoare triple {26306#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,613 INFO L273 TraceCheckUtils]: 138: Hoare triple {26307#(<= main_~i~0 33)} assume true; {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,614 INFO L273 TraceCheckUtils]: 139: Hoare triple {26307#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,614 INFO L273 TraceCheckUtils]: 140: Hoare triple {26307#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26307#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:23,615 INFO L273 TraceCheckUtils]: 141: Hoare triple {26307#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,615 INFO L273 TraceCheckUtils]: 142: Hoare triple {26308#(<= main_~i~0 34)} assume true; {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,616 INFO L273 TraceCheckUtils]: 143: Hoare triple {26308#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,616 INFO L273 TraceCheckUtils]: 144: Hoare triple {26308#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26308#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:23,617 INFO L273 TraceCheckUtils]: 145: Hoare triple {26308#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26309#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:23,617 INFO L273 TraceCheckUtils]: 146: Hoare triple {26309#(<= main_~i~0 35)} assume true; {26309#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:23,618 INFO L273 TraceCheckUtils]: 147: Hoare triple {26309#(<= main_~i~0 35)} assume !(~i~0 < 100000); {26273#false} is VALID [2018-11-18 22:58:23,618 INFO L273 TraceCheckUtils]: 148: Hoare triple {26273#false} havoc ~x~0;~x~0 := 0; {26273#false} is VALID [2018-11-18 22:58:23,618 INFO L273 TraceCheckUtils]: 149: Hoare triple {26273#false} assume true; {26273#false} is VALID [2018-11-18 22:58:23,618 INFO L273 TraceCheckUtils]: 150: Hoare triple {26273#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {26273#false} is VALID [2018-11-18 22:58:23,619 INFO L256 TraceCheckUtils]: 151: Hoare triple {26273#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {26273#false} is VALID [2018-11-18 22:58:23,619 INFO L273 TraceCheckUtils]: 152: Hoare triple {26273#false} ~cond := #in~cond; {26273#false} is VALID [2018-11-18 22:58:23,619 INFO L273 TraceCheckUtils]: 153: Hoare triple {26273#false} assume 0 == ~cond; {26273#false} is VALID [2018-11-18 22:58:23,619 INFO L273 TraceCheckUtils]: 154: Hoare triple {26273#false} assume !false; {26273#false} is VALID [2018-11-18 22:58:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:23,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:58:23,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-18 22:58:23,655 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-11-18 22:58:23,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:58:23,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-18 22:58:23,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:23,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 22:58:23,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 22:58:23,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 22:58:23,809 INFO L87 Difference]: Start difference. First operand 166 states and 204 transitions. Second operand 39 states. [2018-11-18 22:58:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:24,336 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2018-11-18 22:58:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 22:58:24,336 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-11-18 22:58:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:58:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:58:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 233 transitions. [2018-11-18 22:58:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:58:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 233 transitions. [2018-11-18 22:58:24,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 233 transitions. [2018-11-18 22:58:24,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:58:24,545 INFO L225 Difference]: With dead ends: 190 [2018-11-18 22:58:24,545 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 22:58:24,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 22:58:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 22:58:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-18 22:58:24,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:58:24,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 170 states. [2018-11-18 22:58:24,575 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 170 states. [2018-11-18 22:58:24,575 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 170 states. [2018-11-18 22:58:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:24,577 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2018-11-18 22:58:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2018-11-18 22:58:24,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:24,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:24,578 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 172 states. [2018-11-18 22:58:24,578 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 172 states. [2018-11-18 22:58:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:58:24,580 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2018-11-18 22:58:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2018-11-18 22:58:24,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:58:24,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:58:24,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:58:24,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:58:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-18 22:58:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2018-11-18 22:58:24,583 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 155 [2018-11-18 22:58:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:58:24,583 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-18 22:58:24,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 22:58:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2018-11-18 22:58:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-18 22:58:24,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:58:24,585 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:58:24,585 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:58:24,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:58:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1827402866, now seen corresponding path program 36 times [2018-11-18 22:58:24,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:58:24,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:58:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:24,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:58:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:58:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:58:25,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {27576#true} call ULTIMATE.init(); {27576#true} is VALID [2018-11-18 22:58:25,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {27576#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27576#true} is VALID [2018-11-18 22:58:25,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {27576#true} assume true; {27576#true} is VALID [2018-11-18 22:58:25,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27576#true} {27576#true} #73#return; {27576#true} is VALID [2018-11-18 22:58:25,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {27576#true} call #t~ret7 := main(); {27576#true} is VALID [2018-11-18 22:58:25,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {27576#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {27578#(= main_~i~0 0)} is VALID [2018-11-18 22:58:25,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {27578#(= main_~i~0 0)} assume true; {27578#(= main_~i~0 0)} is VALID [2018-11-18 22:58:25,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {27578#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27578#(= main_~i~0 0)} is VALID [2018-11-18 22:58:25,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {27578#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27578#(= main_~i~0 0)} is VALID [2018-11-18 22:58:25,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {27578#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:25,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {27579#(<= main_~i~0 1)} assume true; {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:25,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {27579#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:25,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {27579#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:58:25,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {27579#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:25,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {27580#(<= main_~i~0 2)} assume true; {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:25,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {27580#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:25,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {27580#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:58:25,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {27580#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:25,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {27581#(<= main_~i~0 3)} assume true; {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:25,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {27581#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:25,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {27581#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:58:25,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {27581#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:25,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {27582#(<= main_~i~0 4)} assume true; {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:25,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {27582#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:25,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {27582#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:58:25,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {27582#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:25,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {27583#(<= main_~i~0 5)} assume true; {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:25,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {27583#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:25,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {27583#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:58:25,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {27583#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:25,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {27584#(<= main_~i~0 6)} assume true; {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:25,476 INFO L273 TraceCheckUtils]: 31: Hoare triple {27584#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:25,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {27584#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:58:25,477 INFO L273 TraceCheckUtils]: 33: Hoare triple {27584#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:25,478 INFO L273 TraceCheckUtils]: 34: Hoare triple {27585#(<= main_~i~0 7)} assume true; {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:25,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {27585#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:25,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {27585#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:58:25,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {27585#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:25,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {27586#(<= main_~i~0 8)} assume true; {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:25,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {27586#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:25,481 INFO L273 TraceCheckUtils]: 40: Hoare triple {27586#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:58:25,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {27586#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:25,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {27587#(<= main_~i~0 9)} assume true; {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:25,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {27587#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:25,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {27587#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:58:25,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {27587#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:25,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {27588#(<= main_~i~0 10)} assume true; {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:25,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {27588#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:25,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {27588#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:58:25,485 INFO L273 TraceCheckUtils]: 49: Hoare triple {27588#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:25,486 INFO L273 TraceCheckUtils]: 50: Hoare triple {27589#(<= main_~i~0 11)} assume true; {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:25,486 INFO L273 TraceCheckUtils]: 51: Hoare triple {27589#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:25,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {27589#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:58:25,487 INFO L273 TraceCheckUtils]: 53: Hoare triple {27589#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:25,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {27590#(<= main_~i~0 12)} assume true; {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:25,488 INFO L273 TraceCheckUtils]: 55: Hoare triple {27590#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:25,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {27590#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:58:25,490 INFO L273 TraceCheckUtils]: 57: Hoare triple {27590#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:25,490 INFO L273 TraceCheckUtils]: 58: Hoare triple {27591#(<= main_~i~0 13)} assume true; {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:25,490 INFO L273 TraceCheckUtils]: 59: Hoare triple {27591#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:25,491 INFO L273 TraceCheckUtils]: 60: Hoare triple {27591#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:58:25,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {27591#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:25,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {27592#(<= main_~i~0 14)} assume true; {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:25,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {27592#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:25,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {27592#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:58:25,494 INFO L273 TraceCheckUtils]: 65: Hoare triple {27592#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:25,494 INFO L273 TraceCheckUtils]: 66: Hoare triple {27593#(<= main_~i~0 15)} assume true; {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:25,495 INFO L273 TraceCheckUtils]: 67: Hoare triple {27593#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:25,495 INFO L273 TraceCheckUtils]: 68: Hoare triple {27593#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:58:25,496 INFO L273 TraceCheckUtils]: 69: Hoare triple {27593#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:25,496 INFO L273 TraceCheckUtils]: 70: Hoare triple {27594#(<= main_~i~0 16)} assume true; {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:25,497 INFO L273 TraceCheckUtils]: 71: Hoare triple {27594#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:25,497 INFO L273 TraceCheckUtils]: 72: Hoare triple {27594#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:58:25,498 INFO L273 TraceCheckUtils]: 73: Hoare triple {27594#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:25,498 INFO L273 TraceCheckUtils]: 74: Hoare triple {27595#(<= main_~i~0 17)} assume true; {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:25,499 INFO L273 TraceCheckUtils]: 75: Hoare triple {27595#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:25,499 INFO L273 TraceCheckUtils]: 76: Hoare triple {27595#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:58:25,500 INFO L273 TraceCheckUtils]: 77: Hoare triple {27595#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:25,500 INFO L273 TraceCheckUtils]: 78: Hoare triple {27596#(<= main_~i~0 18)} assume true; {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:25,501 INFO L273 TraceCheckUtils]: 79: Hoare triple {27596#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:25,501 INFO L273 TraceCheckUtils]: 80: Hoare triple {27596#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:58:25,502 INFO L273 TraceCheckUtils]: 81: Hoare triple {27596#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:25,502 INFO L273 TraceCheckUtils]: 82: Hoare triple {27597#(<= main_~i~0 19)} assume true; {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:25,503 INFO L273 TraceCheckUtils]: 83: Hoare triple {27597#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:25,503 INFO L273 TraceCheckUtils]: 84: Hoare triple {27597#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:58:25,504 INFO L273 TraceCheckUtils]: 85: Hoare triple {27597#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:25,504 INFO L273 TraceCheckUtils]: 86: Hoare triple {27598#(<= main_~i~0 20)} assume true; {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:25,505 INFO L273 TraceCheckUtils]: 87: Hoare triple {27598#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:25,505 INFO L273 TraceCheckUtils]: 88: Hoare triple {27598#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:58:25,506 INFO L273 TraceCheckUtils]: 89: Hoare triple {27598#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:25,506 INFO L273 TraceCheckUtils]: 90: Hoare triple {27599#(<= main_~i~0 21)} assume true; {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:25,507 INFO L273 TraceCheckUtils]: 91: Hoare triple {27599#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:25,507 INFO L273 TraceCheckUtils]: 92: Hoare triple {27599#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:58:25,508 INFO L273 TraceCheckUtils]: 93: Hoare triple {27599#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:25,509 INFO L273 TraceCheckUtils]: 94: Hoare triple {27600#(<= main_~i~0 22)} assume true; {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:25,509 INFO L273 TraceCheckUtils]: 95: Hoare triple {27600#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:25,510 INFO L273 TraceCheckUtils]: 96: Hoare triple {27600#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:58:25,510 INFO L273 TraceCheckUtils]: 97: Hoare triple {27600#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:25,511 INFO L273 TraceCheckUtils]: 98: Hoare triple {27601#(<= main_~i~0 23)} assume true; {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:25,511 INFO L273 TraceCheckUtils]: 99: Hoare triple {27601#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:25,512 INFO L273 TraceCheckUtils]: 100: Hoare triple {27601#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:58:25,512 INFO L273 TraceCheckUtils]: 101: Hoare triple {27601#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:25,513 INFO L273 TraceCheckUtils]: 102: Hoare triple {27602#(<= main_~i~0 24)} assume true; {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:25,513 INFO L273 TraceCheckUtils]: 103: Hoare triple {27602#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:25,514 INFO L273 TraceCheckUtils]: 104: Hoare triple {27602#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:58:25,515 INFO L273 TraceCheckUtils]: 105: Hoare triple {27602#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:25,515 INFO L273 TraceCheckUtils]: 106: Hoare triple {27603#(<= main_~i~0 25)} assume true; {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:25,516 INFO L273 TraceCheckUtils]: 107: Hoare triple {27603#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:25,516 INFO L273 TraceCheckUtils]: 108: Hoare triple {27603#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:58:25,517 INFO L273 TraceCheckUtils]: 109: Hoare triple {27603#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:25,517 INFO L273 TraceCheckUtils]: 110: Hoare triple {27604#(<= main_~i~0 26)} assume true; {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:25,518 INFO L273 TraceCheckUtils]: 111: Hoare triple {27604#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:25,518 INFO L273 TraceCheckUtils]: 112: Hoare triple {27604#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:58:25,519 INFO L273 TraceCheckUtils]: 113: Hoare triple {27604#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:25,519 INFO L273 TraceCheckUtils]: 114: Hoare triple {27605#(<= main_~i~0 27)} assume true; {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:25,520 INFO L273 TraceCheckUtils]: 115: Hoare triple {27605#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:25,520 INFO L273 TraceCheckUtils]: 116: Hoare triple {27605#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:58:25,521 INFO L273 TraceCheckUtils]: 117: Hoare triple {27605#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:25,521 INFO L273 TraceCheckUtils]: 118: Hoare triple {27606#(<= main_~i~0 28)} assume true; {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:25,522 INFO L273 TraceCheckUtils]: 119: Hoare triple {27606#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:25,522 INFO L273 TraceCheckUtils]: 120: Hoare triple {27606#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:58:25,523 INFO L273 TraceCheckUtils]: 121: Hoare triple {27606#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:25,523 INFO L273 TraceCheckUtils]: 122: Hoare triple {27607#(<= main_~i~0 29)} assume true; {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:25,524 INFO L273 TraceCheckUtils]: 123: Hoare triple {27607#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:25,524 INFO L273 TraceCheckUtils]: 124: Hoare triple {27607#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:58:25,525 INFO L273 TraceCheckUtils]: 125: Hoare triple {27607#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:25,526 INFO L273 TraceCheckUtils]: 126: Hoare triple {27608#(<= main_~i~0 30)} assume true; {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:25,526 INFO L273 TraceCheckUtils]: 127: Hoare triple {27608#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:25,526 INFO L273 TraceCheckUtils]: 128: Hoare triple {27608#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:58:25,527 INFO L273 TraceCheckUtils]: 129: Hoare triple {27608#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:25,528 INFO L273 TraceCheckUtils]: 130: Hoare triple {27609#(<= main_~i~0 31)} assume true; {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:25,528 INFO L273 TraceCheckUtils]: 131: Hoare triple {27609#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:25,529 INFO L273 TraceCheckUtils]: 132: Hoare triple {27609#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:58:25,529 INFO L273 TraceCheckUtils]: 133: Hoare triple {27609#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:25,530 INFO L273 TraceCheckUtils]: 134: Hoare triple {27610#(<= main_~i~0 32)} assume true; {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:25,530 INFO L273 TraceCheckUtils]: 135: Hoare triple {27610#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:25,531 INFO L273 TraceCheckUtils]: 136: Hoare triple {27610#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:58:25,531 INFO L273 TraceCheckUtils]: 137: Hoare triple {27610#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:25,532 INFO L273 TraceCheckUtils]: 138: Hoare triple {27611#(<= main_~i~0 33)} assume true; {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:25,532 INFO L273 TraceCheckUtils]: 139: Hoare triple {27611#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:25,533 INFO L273 TraceCheckUtils]: 140: Hoare triple {27611#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:58:25,533 INFO L273 TraceCheckUtils]: 141: Hoare triple {27611#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:25,534 INFO L273 TraceCheckUtils]: 142: Hoare triple {27612#(<= main_~i~0 34)} assume true; {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:25,534 INFO L273 TraceCheckUtils]: 143: Hoare triple {27612#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:25,535 INFO L273 TraceCheckUtils]: 144: Hoare triple {27612#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:58:25,535 INFO L273 TraceCheckUtils]: 145: Hoare triple {27612#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:25,536 INFO L273 TraceCheckUtils]: 146: Hoare triple {27613#(<= main_~i~0 35)} assume true; {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:25,536 INFO L273 TraceCheckUtils]: 147: Hoare triple {27613#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:25,537 INFO L273 TraceCheckUtils]: 148: Hoare triple {27613#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:58:25,537 INFO L273 TraceCheckUtils]: 149: Hoare triple {27613#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27614#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:25,538 INFO L273 TraceCheckUtils]: 150: Hoare triple {27614#(<= main_~i~0 36)} assume true; {27614#(<= main_~i~0 36)} is VALID [2018-11-18 22:58:25,539 INFO L273 TraceCheckUtils]: 151: Hoare triple {27614#(<= main_~i~0 36)} assume !(~i~0 < 100000); {27577#false} is VALID [2018-11-18 22:58:25,539 INFO L273 TraceCheckUtils]: 152: Hoare triple {27577#false} havoc ~x~0;~x~0 := 0; {27577#false} is VALID [2018-11-18 22:58:25,539 INFO L273 TraceCheckUtils]: 153: Hoare triple {27577#false} assume true; {27577#false} is VALID [2018-11-18 22:58:25,539 INFO L273 TraceCheckUtils]: 154: Hoare triple {27577#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {27577#false} is VALID [2018-11-18 22:58:25,539 INFO L256 TraceCheckUtils]: 155: Hoare triple {27577#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {27577#false} is VALID [2018-11-18 22:58:25,539 INFO L273 TraceCheckUtils]: 156: Hoare triple {27577#false} ~cond := #in~cond; {27577#false} is VALID [2018-11-18 22:58:25,540 INFO L273 TraceCheckUtils]: 157: Hoare triple {27577#false} assume 0 == ~cond; {27577#false} is VALID [2018-11-18 22:58:25,540 INFO L273 TraceCheckUtils]: 158: Hoare triple {27577#false} assume !false; {27577#false} is VALID [2018-11-18 22:58:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:58:25,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:58:25,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:58:25,584 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:59:05,383 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-18 22:59:05,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:59:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:05,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:06,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {27576#true} call ULTIMATE.init(); {27576#true} is VALID [2018-11-18 22:59:06,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {27576#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27576#true} is VALID [2018-11-18 22:59:06,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {27576#true} assume true; {27576#true} is VALID [2018-11-18 22:59:06,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27576#true} {27576#true} #73#return; {27576#true} is VALID [2018-11-18 22:59:06,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {27576#true} call #t~ret7 := main(); {27576#true} is VALID [2018-11-18 22:59:06,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {27576#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {27633#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:06,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {27633#(<= main_~i~0 0)} assume true; {27633#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:06,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {27633#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27633#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:06,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {27633#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27633#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:06,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {27633#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:06,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {27579#(<= main_~i~0 1)} assume true; {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:06,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {27579#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:06,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {27579#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27579#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:06,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {27579#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:06,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {27580#(<= main_~i~0 2)} assume true; {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:06,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {27580#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:06,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {27580#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27580#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:06,429 INFO L273 TraceCheckUtils]: 17: Hoare triple {27580#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:06,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {27581#(<= main_~i~0 3)} assume true; {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:06,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {27581#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:06,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {27581#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27581#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:06,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {27581#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:06,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {27582#(<= main_~i~0 4)} assume true; {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:06,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {27582#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:06,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {27582#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27582#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:06,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {27582#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:06,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {27583#(<= main_~i~0 5)} assume true; {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:06,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {27583#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:06,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {27583#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27583#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:06,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {27583#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:06,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {27584#(<= main_~i~0 6)} assume true; {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:06,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {27584#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:06,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {27584#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27584#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:06,437 INFO L273 TraceCheckUtils]: 33: Hoare triple {27584#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:06,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {27585#(<= main_~i~0 7)} assume true; {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:06,438 INFO L273 TraceCheckUtils]: 35: Hoare triple {27585#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:06,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {27585#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27585#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:06,439 INFO L273 TraceCheckUtils]: 37: Hoare triple {27585#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:06,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {27586#(<= main_~i~0 8)} assume true; {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:06,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {27586#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:06,441 INFO L273 TraceCheckUtils]: 40: Hoare triple {27586#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27586#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:06,442 INFO L273 TraceCheckUtils]: 41: Hoare triple {27586#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:06,442 INFO L273 TraceCheckUtils]: 42: Hoare triple {27587#(<= main_~i~0 9)} assume true; {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:06,443 INFO L273 TraceCheckUtils]: 43: Hoare triple {27587#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:06,443 INFO L273 TraceCheckUtils]: 44: Hoare triple {27587#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27587#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:06,444 INFO L273 TraceCheckUtils]: 45: Hoare triple {27587#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:06,444 INFO L273 TraceCheckUtils]: 46: Hoare triple {27588#(<= main_~i~0 10)} assume true; {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:06,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {27588#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:06,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {27588#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27588#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:06,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {27588#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:06,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {27589#(<= main_~i~0 11)} assume true; {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:06,447 INFO L273 TraceCheckUtils]: 51: Hoare triple {27589#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:06,447 INFO L273 TraceCheckUtils]: 52: Hoare triple {27589#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27589#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:06,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {27589#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:06,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {27590#(<= main_~i~0 12)} assume true; {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:06,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {27590#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:06,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {27590#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27590#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:06,450 INFO L273 TraceCheckUtils]: 57: Hoare triple {27590#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:06,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {27591#(<= main_~i~0 13)} assume true; {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:06,451 INFO L273 TraceCheckUtils]: 59: Hoare triple {27591#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:06,451 INFO L273 TraceCheckUtils]: 60: Hoare triple {27591#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27591#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:06,452 INFO L273 TraceCheckUtils]: 61: Hoare triple {27591#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:06,453 INFO L273 TraceCheckUtils]: 62: Hoare triple {27592#(<= main_~i~0 14)} assume true; {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:06,453 INFO L273 TraceCheckUtils]: 63: Hoare triple {27592#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:06,454 INFO L273 TraceCheckUtils]: 64: Hoare triple {27592#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27592#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:06,454 INFO L273 TraceCheckUtils]: 65: Hoare triple {27592#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:06,455 INFO L273 TraceCheckUtils]: 66: Hoare triple {27593#(<= main_~i~0 15)} assume true; {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:06,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {27593#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:06,456 INFO L273 TraceCheckUtils]: 68: Hoare triple {27593#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27593#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:06,456 INFO L273 TraceCheckUtils]: 69: Hoare triple {27593#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:06,457 INFO L273 TraceCheckUtils]: 70: Hoare triple {27594#(<= main_~i~0 16)} assume true; {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:06,457 INFO L273 TraceCheckUtils]: 71: Hoare triple {27594#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:06,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {27594#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27594#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:06,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {27594#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:06,459 INFO L273 TraceCheckUtils]: 74: Hoare triple {27595#(<= main_~i~0 17)} assume true; {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:06,459 INFO L273 TraceCheckUtils]: 75: Hoare triple {27595#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:06,460 INFO L273 TraceCheckUtils]: 76: Hoare triple {27595#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27595#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:06,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {27595#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:06,461 INFO L273 TraceCheckUtils]: 78: Hoare triple {27596#(<= main_~i~0 18)} assume true; {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:06,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {27596#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:06,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {27596#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27596#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:06,463 INFO L273 TraceCheckUtils]: 81: Hoare triple {27596#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:06,463 INFO L273 TraceCheckUtils]: 82: Hoare triple {27597#(<= main_~i~0 19)} assume true; {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:06,464 INFO L273 TraceCheckUtils]: 83: Hoare triple {27597#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:06,464 INFO L273 TraceCheckUtils]: 84: Hoare triple {27597#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27597#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:06,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {27597#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:06,465 INFO L273 TraceCheckUtils]: 86: Hoare triple {27598#(<= main_~i~0 20)} assume true; {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:06,466 INFO L273 TraceCheckUtils]: 87: Hoare triple {27598#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:06,466 INFO L273 TraceCheckUtils]: 88: Hoare triple {27598#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27598#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:06,467 INFO L273 TraceCheckUtils]: 89: Hoare triple {27598#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:06,467 INFO L273 TraceCheckUtils]: 90: Hoare triple {27599#(<= main_~i~0 21)} assume true; {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:06,468 INFO L273 TraceCheckUtils]: 91: Hoare triple {27599#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:06,468 INFO L273 TraceCheckUtils]: 92: Hoare triple {27599#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27599#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:06,469 INFO L273 TraceCheckUtils]: 93: Hoare triple {27599#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:06,470 INFO L273 TraceCheckUtils]: 94: Hoare triple {27600#(<= main_~i~0 22)} assume true; {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:06,478 INFO L273 TraceCheckUtils]: 95: Hoare triple {27600#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:06,478 INFO L273 TraceCheckUtils]: 96: Hoare triple {27600#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27600#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:06,479 INFO L273 TraceCheckUtils]: 97: Hoare triple {27600#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:06,479 INFO L273 TraceCheckUtils]: 98: Hoare triple {27601#(<= main_~i~0 23)} assume true; {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:06,480 INFO L273 TraceCheckUtils]: 99: Hoare triple {27601#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:06,480 INFO L273 TraceCheckUtils]: 100: Hoare triple {27601#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27601#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:06,480 INFO L273 TraceCheckUtils]: 101: Hoare triple {27601#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:06,481 INFO L273 TraceCheckUtils]: 102: Hoare triple {27602#(<= main_~i~0 24)} assume true; {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:06,481 INFO L273 TraceCheckUtils]: 103: Hoare triple {27602#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:06,481 INFO L273 TraceCheckUtils]: 104: Hoare triple {27602#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27602#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:06,482 INFO L273 TraceCheckUtils]: 105: Hoare triple {27602#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:06,482 INFO L273 TraceCheckUtils]: 106: Hoare triple {27603#(<= main_~i~0 25)} assume true; {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:06,482 INFO L273 TraceCheckUtils]: 107: Hoare triple {27603#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:06,482 INFO L273 TraceCheckUtils]: 108: Hoare triple {27603#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27603#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:06,483 INFO L273 TraceCheckUtils]: 109: Hoare triple {27603#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:06,483 INFO L273 TraceCheckUtils]: 110: Hoare triple {27604#(<= main_~i~0 26)} assume true; {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:06,484 INFO L273 TraceCheckUtils]: 111: Hoare triple {27604#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:06,484 INFO L273 TraceCheckUtils]: 112: Hoare triple {27604#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27604#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:06,485 INFO L273 TraceCheckUtils]: 113: Hoare triple {27604#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:06,485 INFO L273 TraceCheckUtils]: 114: Hoare triple {27605#(<= main_~i~0 27)} assume true; {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:06,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {27605#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:06,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {27605#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27605#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:06,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {27605#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:06,488 INFO L273 TraceCheckUtils]: 118: Hoare triple {27606#(<= main_~i~0 28)} assume true; {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:06,488 INFO L273 TraceCheckUtils]: 119: Hoare triple {27606#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:06,489 INFO L273 TraceCheckUtils]: 120: Hoare triple {27606#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27606#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:06,489 INFO L273 TraceCheckUtils]: 121: Hoare triple {27606#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:06,490 INFO L273 TraceCheckUtils]: 122: Hoare triple {27607#(<= main_~i~0 29)} assume true; {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:06,490 INFO L273 TraceCheckUtils]: 123: Hoare triple {27607#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:06,491 INFO L273 TraceCheckUtils]: 124: Hoare triple {27607#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27607#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:06,491 INFO L273 TraceCheckUtils]: 125: Hoare triple {27607#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:06,492 INFO L273 TraceCheckUtils]: 126: Hoare triple {27608#(<= main_~i~0 30)} assume true; {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:06,492 INFO L273 TraceCheckUtils]: 127: Hoare triple {27608#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:06,493 INFO L273 TraceCheckUtils]: 128: Hoare triple {27608#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27608#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:06,493 INFO L273 TraceCheckUtils]: 129: Hoare triple {27608#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:06,494 INFO L273 TraceCheckUtils]: 130: Hoare triple {27609#(<= main_~i~0 31)} assume true; {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:06,494 INFO L273 TraceCheckUtils]: 131: Hoare triple {27609#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:06,495 INFO L273 TraceCheckUtils]: 132: Hoare triple {27609#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27609#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:06,496 INFO L273 TraceCheckUtils]: 133: Hoare triple {27609#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:06,496 INFO L273 TraceCheckUtils]: 134: Hoare triple {27610#(<= main_~i~0 32)} assume true; {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:06,497 INFO L273 TraceCheckUtils]: 135: Hoare triple {27610#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:06,497 INFO L273 TraceCheckUtils]: 136: Hoare triple {27610#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27610#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:06,498 INFO L273 TraceCheckUtils]: 137: Hoare triple {27610#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:06,498 INFO L273 TraceCheckUtils]: 138: Hoare triple {27611#(<= main_~i~0 33)} assume true; {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:06,499 INFO L273 TraceCheckUtils]: 139: Hoare triple {27611#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:06,499 INFO L273 TraceCheckUtils]: 140: Hoare triple {27611#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27611#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:06,500 INFO L273 TraceCheckUtils]: 141: Hoare triple {27611#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:06,500 INFO L273 TraceCheckUtils]: 142: Hoare triple {27612#(<= main_~i~0 34)} assume true; {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:06,501 INFO L273 TraceCheckUtils]: 143: Hoare triple {27612#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:06,501 INFO L273 TraceCheckUtils]: 144: Hoare triple {27612#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27612#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:06,502 INFO L273 TraceCheckUtils]: 145: Hoare triple {27612#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:06,503 INFO L273 TraceCheckUtils]: 146: Hoare triple {27613#(<= main_~i~0 35)} assume true; {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:06,503 INFO L273 TraceCheckUtils]: 147: Hoare triple {27613#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:06,504 INFO L273 TraceCheckUtils]: 148: Hoare triple {27613#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27613#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:06,504 INFO L273 TraceCheckUtils]: 149: Hoare triple {27613#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27614#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:06,505 INFO L273 TraceCheckUtils]: 150: Hoare triple {27614#(<= main_~i~0 36)} assume true; {27614#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:06,505 INFO L273 TraceCheckUtils]: 151: Hoare triple {27614#(<= main_~i~0 36)} assume !(~i~0 < 100000); {27577#false} is VALID [2018-11-18 22:59:06,506 INFO L273 TraceCheckUtils]: 152: Hoare triple {27577#false} havoc ~x~0;~x~0 := 0; {27577#false} is VALID [2018-11-18 22:59:06,506 INFO L273 TraceCheckUtils]: 153: Hoare triple {27577#false} assume true; {27577#false} is VALID [2018-11-18 22:59:06,506 INFO L273 TraceCheckUtils]: 154: Hoare triple {27577#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {27577#false} is VALID [2018-11-18 22:59:06,506 INFO L256 TraceCheckUtils]: 155: Hoare triple {27577#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {27577#false} is VALID [2018-11-18 22:59:06,506 INFO L273 TraceCheckUtils]: 156: Hoare triple {27577#false} ~cond := #in~cond; {27577#false} is VALID [2018-11-18 22:59:06,506 INFO L273 TraceCheckUtils]: 157: Hoare triple {27577#false} assume 0 == ~cond; {27577#false} is VALID [2018-11-18 22:59:06,507 INFO L273 TraceCheckUtils]: 158: Hoare triple {27577#false} assume !false; {27577#false} is VALID [2018-11-18 22:59:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:06,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:06,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-18 22:59:06,548 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-18 22:59:06,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:06,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-18 22:59:06,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:06,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 22:59:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 22:59:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 22:59:06,705 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand 40 states. [2018-11-18 22:59:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:07,631 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2018-11-18 22:59:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 22:59:07,631 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-18 22:59:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:59:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 238 transitions. [2018-11-18 22:59:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 22:59:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 238 transitions. [2018-11-18 22:59:07,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 238 transitions. [2018-11-18 22:59:07,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:07,846 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:59:07,846 INFO L226 Difference]: Without dead ends: 176 [2018-11-18 22:59:07,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 22:59:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-18 22:59:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-11-18 22:59:07,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:07,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand 174 states. [2018-11-18 22:59:07,880 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand 174 states. [2018-11-18 22:59:07,880 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 174 states. [2018-11-18 22:59:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:07,884 INFO L93 Difference]: Finished difference Result 176 states and 217 transitions. [2018-11-18 22:59:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 217 transitions. [2018-11-18 22:59:07,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:07,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:07,885 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 176 states. [2018-11-18 22:59:07,885 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 176 states. [2018-11-18 22:59:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:07,888 INFO L93 Difference]: Finished difference Result 176 states and 217 transitions. [2018-11-18 22:59:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 217 transitions. [2018-11-18 22:59:07,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:07,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:07,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:07,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-18 22:59:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 214 transitions. [2018-11-18 22:59:07,892 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 214 transitions. Word has length 159 [2018-11-18 22:59:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:07,892 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 214 transitions. [2018-11-18 22:59:07,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 22:59:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2018-11-18 22:59:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 22:59:07,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:07,894 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:07,894 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:07,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 824592293, now seen corresponding path program 37 times [2018-11-18 22:59:07,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:07,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:59:07,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:08,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {28911#true} call ULTIMATE.init(); {28911#true} is VALID [2018-11-18 22:59:08,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {28911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28911#true} is VALID [2018-11-18 22:59:08,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {28911#true} assume true; {28911#true} is VALID [2018-11-18 22:59:08,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28911#true} {28911#true} #73#return; {28911#true} is VALID [2018-11-18 22:59:08,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {28911#true} call #t~ret7 := main(); {28911#true} is VALID [2018-11-18 22:59:08,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {28911#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {28913#(= main_~i~0 0)} is VALID [2018-11-18 22:59:08,994 INFO L273 TraceCheckUtils]: 6: Hoare triple {28913#(= main_~i~0 0)} assume true; {28913#(= main_~i~0 0)} is VALID [2018-11-18 22:59:08,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {28913#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28913#(= main_~i~0 0)} is VALID [2018-11-18 22:59:08,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {28913#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28913#(= main_~i~0 0)} is VALID [2018-11-18 22:59:08,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {28913#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {28914#(<= main_~i~0 1)} assume true; {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {28914#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {28914#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:08,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {28914#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {28915#(<= main_~i~0 2)} assume true; {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {28915#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {28915#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:08,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {28915#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:08,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {28916#(<= main_~i~0 3)} assume true; {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:08,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {28916#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:09,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {28916#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:09,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {28916#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {28917#(<= main_~i~0 4)} assume true; {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {28917#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {28917#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {28917#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {28918#(<= main_~i~0 5)} assume true; {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {28918#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {28918#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {28918#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {28919#(<= main_~i~0 6)} assume true; {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {28919#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,006 INFO L273 TraceCheckUtils]: 32: Hoare triple {28919#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,007 INFO L273 TraceCheckUtils]: 33: Hoare triple {28919#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {28920#(<= main_~i~0 7)} assume true; {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,008 INFO L273 TraceCheckUtils]: 35: Hoare triple {28920#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {28920#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {28920#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {28921#(<= main_~i~0 8)} assume true; {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,010 INFO L273 TraceCheckUtils]: 39: Hoare triple {28921#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {28921#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~0 9)} assume true; {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {28922#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {28922#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {28922#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {28923#(<= main_~i~0 10)} assume true; {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {28923#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {28923#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {28923#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {28924#(<= main_~i~0 11)} assume true; {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {28924#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,016 INFO L273 TraceCheckUtils]: 52: Hoare triple {28924#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,017 INFO L273 TraceCheckUtils]: 53: Hoare triple {28924#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,017 INFO L273 TraceCheckUtils]: 54: Hoare triple {28925#(<= main_~i~0 12)} assume true; {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {28925#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,018 INFO L273 TraceCheckUtils]: 56: Hoare triple {28925#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {28925#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {28926#(<= main_~i~0 13)} assume true; {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,020 INFO L273 TraceCheckUtils]: 59: Hoare triple {28926#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {28926#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,021 INFO L273 TraceCheckUtils]: 61: Hoare triple {28926#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,022 INFO L273 TraceCheckUtils]: 62: Hoare triple {28927#(<= main_~i~0 14)} assume true; {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,022 INFO L273 TraceCheckUtils]: 63: Hoare triple {28927#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {28927#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,024 INFO L273 TraceCheckUtils]: 65: Hoare triple {28927#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,024 INFO L273 TraceCheckUtils]: 66: Hoare triple {28928#(<= main_~i~0 15)} assume true; {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,025 INFO L273 TraceCheckUtils]: 67: Hoare triple {28928#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,025 INFO L273 TraceCheckUtils]: 68: Hoare triple {28928#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,026 INFO L273 TraceCheckUtils]: 69: Hoare triple {28928#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,026 INFO L273 TraceCheckUtils]: 70: Hoare triple {28929#(<= main_~i~0 16)} assume true; {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,027 INFO L273 TraceCheckUtils]: 71: Hoare triple {28929#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,027 INFO L273 TraceCheckUtils]: 72: Hoare triple {28929#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,028 INFO L273 TraceCheckUtils]: 73: Hoare triple {28929#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,028 INFO L273 TraceCheckUtils]: 74: Hoare triple {28930#(<= main_~i~0 17)} assume true; {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,029 INFO L273 TraceCheckUtils]: 75: Hoare triple {28930#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,029 INFO L273 TraceCheckUtils]: 76: Hoare triple {28930#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,030 INFO L273 TraceCheckUtils]: 77: Hoare triple {28930#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,031 INFO L273 TraceCheckUtils]: 78: Hoare triple {28931#(<= main_~i~0 18)} assume true; {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,031 INFO L273 TraceCheckUtils]: 79: Hoare triple {28931#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,032 INFO L273 TraceCheckUtils]: 80: Hoare triple {28931#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,032 INFO L273 TraceCheckUtils]: 81: Hoare triple {28931#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,033 INFO L273 TraceCheckUtils]: 82: Hoare triple {28932#(<= main_~i~0 19)} assume true; {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,033 INFO L273 TraceCheckUtils]: 83: Hoare triple {28932#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,034 INFO L273 TraceCheckUtils]: 84: Hoare triple {28932#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,034 INFO L273 TraceCheckUtils]: 85: Hoare triple {28932#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,035 INFO L273 TraceCheckUtils]: 86: Hoare triple {28933#(<= main_~i~0 20)} assume true; {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,035 INFO L273 TraceCheckUtils]: 87: Hoare triple {28933#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,036 INFO L273 TraceCheckUtils]: 88: Hoare triple {28933#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,036 INFO L273 TraceCheckUtils]: 89: Hoare triple {28933#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,037 INFO L273 TraceCheckUtils]: 90: Hoare triple {28934#(<= main_~i~0 21)} assume true; {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,058 INFO L273 TraceCheckUtils]: 91: Hoare triple {28934#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,071 INFO L273 TraceCheckUtils]: 92: Hoare triple {28934#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,085 INFO L273 TraceCheckUtils]: 93: Hoare triple {28934#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,090 INFO L273 TraceCheckUtils]: 94: Hoare triple {28935#(<= main_~i~0 22)} assume true; {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,090 INFO L273 TraceCheckUtils]: 95: Hoare triple {28935#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,090 INFO L273 TraceCheckUtils]: 96: Hoare triple {28935#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,091 INFO L273 TraceCheckUtils]: 97: Hoare triple {28935#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,091 INFO L273 TraceCheckUtils]: 98: Hoare triple {28936#(<= main_~i~0 23)} assume true; {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,092 INFO L273 TraceCheckUtils]: 99: Hoare triple {28936#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,092 INFO L273 TraceCheckUtils]: 100: Hoare triple {28936#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,092 INFO L273 TraceCheckUtils]: 101: Hoare triple {28936#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,093 INFO L273 TraceCheckUtils]: 102: Hoare triple {28937#(<= main_~i~0 24)} assume true; {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,093 INFO L273 TraceCheckUtils]: 103: Hoare triple {28937#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,093 INFO L273 TraceCheckUtils]: 104: Hoare triple {28937#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,094 INFO L273 TraceCheckUtils]: 105: Hoare triple {28937#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,094 INFO L273 TraceCheckUtils]: 106: Hoare triple {28938#(<= main_~i~0 25)} assume true; {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,094 INFO L273 TraceCheckUtils]: 107: Hoare triple {28938#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,095 INFO L273 TraceCheckUtils]: 108: Hoare triple {28938#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,095 INFO L273 TraceCheckUtils]: 109: Hoare triple {28938#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,096 INFO L273 TraceCheckUtils]: 110: Hoare triple {28939#(<= main_~i~0 26)} assume true; {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,096 INFO L273 TraceCheckUtils]: 111: Hoare triple {28939#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,097 INFO L273 TraceCheckUtils]: 112: Hoare triple {28939#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,098 INFO L273 TraceCheckUtils]: 113: Hoare triple {28939#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,098 INFO L273 TraceCheckUtils]: 114: Hoare triple {28940#(<= main_~i~0 27)} assume true; {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,098 INFO L273 TraceCheckUtils]: 115: Hoare triple {28940#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,099 INFO L273 TraceCheckUtils]: 116: Hoare triple {28940#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,100 INFO L273 TraceCheckUtils]: 117: Hoare triple {28940#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,100 INFO L273 TraceCheckUtils]: 118: Hoare triple {28941#(<= main_~i~0 28)} assume true; {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,101 INFO L273 TraceCheckUtils]: 119: Hoare triple {28941#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,101 INFO L273 TraceCheckUtils]: 120: Hoare triple {28941#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,102 INFO L273 TraceCheckUtils]: 121: Hoare triple {28941#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,102 INFO L273 TraceCheckUtils]: 122: Hoare triple {28942#(<= main_~i~0 29)} assume true; {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,103 INFO L273 TraceCheckUtils]: 123: Hoare triple {28942#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,103 INFO L273 TraceCheckUtils]: 124: Hoare triple {28942#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,104 INFO L273 TraceCheckUtils]: 125: Hoare triple {28942#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,104 INFO L273 TraceCheckUtils]: 126: Hoare triple {28943#(<= main_~i~0 30)} assume true; {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,105 INFO L273 TraceCheckUtils]: 127: Hoare triple {28943#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,105 INFO L273 TraceCheckUtils]: 128: Hoare triple {28943#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,106 INFO L273 TraceCheckUtils]: 129: Hoare triple {28943#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,106 INFO L273 TraceCheckUtils]: 130: Hoare triple {28944#(<= main_~i~0 31)} assume true; {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,107 INFO L273 TraceCheckUtils]: 131: Hoare triple {28944#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,107 INFO L273 TraceCheckUtils]: 132: Hoare triple {28944#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,108 INFO L273 TraceCheckUtils]: 133: Hoare triple {28944#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,108 INFO L273 TraceCheckUtils]: 134: Hoare triple {28945#(<= main_~i~0 32)} assume true; {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,109 INFO L273 TraceCheckUtils]: 135: Hoare triple {28945#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,109 INFO L273 TraceCheckUtils]: 136: Hoare triple {28945#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,110 INFO L273 TraceCheckUtils]: 137: Hoare triple {28945#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,110 INFO L273 TraceCheckUtils]: 138: Hoare triple {28946#(<= main_~i~0 33)} assume true; {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,111 INFO L273 TraceCheckUtils]: 139: Hoare triple {28946#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,111 INFO L273 TraceCheckUtils]: 140: Hoare triple {28946#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,112 INFO L273 TraceCheckUtils]: 141: Hoare triple {28946#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,112 INFO L273 TraceCheckUtils]: 142: Hoare triple {28947#(<= main_~i~0 34)} assume true; {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,113 INFO L273 TraceCheckUtils]: 143: Hoare triple {28947#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,113 INFO L273 TraceCheckUtils]: 144: Hoare triple {28947#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,114 INFO L273 TraceCheckUtils]: 145: Hoare triple {28947#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,115 INFO L273 TraceCheckUtils]: 146: Hoare triple {28948#(<= main_~i~0 35)} assume true; {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,115 INFO L273 TraceCheckUtils]: 147: Hoare triple {28948#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,115 INFO L273 TraceCheckUtils]: 148: Hoare triple {28948#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,116 INFO L273 TraceCheckUtils]: 149: Hoare triple {28948#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,117 INFO L273 TraceCheckUtils]: 150: Hoare triple {28949#(<= main_~i~0 36)} assume true; {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,117 INFO L273 TraceCheckUtils]: 151: Hoare triple {28949#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,118 INFO L273 TraceCheckUtils]: 152: Hoare triple {28949#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,118 INFO L273 TraceCheckUtils]: 153: Hoare triple {28949#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28950#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:09,119 INFO L273 TraceCheckUtils]: 154: Hoare triple {28950#(<= main_~i~0 37)} assume true; {28950#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:09,119 INFO L273 TraceCheckUtils]: 155: Hoare triple {28950#(<= main_~i~0 37)} assume !(~i~0 < 100000); {28912#false} is VALID [2018-11-18 22:59:09,120 INFO L273 TraceCheckUtils]: 156: Hoare triple {28912#false} havoc ~x~0;~x~0 := 0; {28912#false} is VALID [2018-11-18 22:59:09,120 INFO L273 TraceCheckUtils]: 157: Hoare triple {28912#false} assume true; {28912#false} is VALID [2018-11-18 22:59:09,120 INFO L273 TraceCheckUtils]: 158: Hoare triple {28912#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {28912#false} is VALID [2018-11-18 22:59:09,120 INFO L256 TraceCheckUtils]: 159: Hoare triple {28912#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {28912#false} is VALID [2018-11-18 22:59:09,120 INFO L273 TraceCheckUtils]: 160: Hoare triple {28912#false} ~cond := #in~cond; {28912#false} is VALID [2018-11-18 22:59:09,120 INFO L273 TraceCheckUtils]: 161: Hoare triple {28912#false} assume 0 == ~cond; {28912#false} is VALID [2018-11-18 22:59:09,121 INFO L273 TraceCheckUtils]: 162: Hoare triple {28912#false} assume !false; {28912#false} is VALID [2018-11-18 22:59:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:09,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:09,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:09,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:59:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:09,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:09,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {28911#true} call ULTIMATE.init(); {28911#true} is VALID [2018-11-18 22:59:09,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {28911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28911#true} is VALID [2018-11-18 22:59:09,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {28911#true} assume true; {28911#true} is VALID [2018-11-18 22:59:09,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28911#true} {28911#true} #73#return; {28911#true} is VALID [2018-11-18 22:59:09,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {28911#true} call #t~ret7 := main(); {28911#true} is VALID [2018-11-18 22:59:09,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {28911#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {28969#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:09,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {28969#(<= main_~i~0 0)} assume true; {28969#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:09,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {28969#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28969#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:09,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {28969#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28969#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:09,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {28969#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:09,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {28914#(<= main_~i~0 1)} assume true; {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:09,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {28914#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:09,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {28914#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28914#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:09,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {28914#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:09,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {28915#(<= main_~i~0 2)} assume true; {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:09,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {28915#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:09,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {28915#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28915#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:09,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {28915#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:09,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {28916#(<= main_~i~0 3)} assume true; {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:09,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {28916#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:09,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {28916#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28916#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:09,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {28916#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {28917#(<= main_~i~0 4)} assume true; {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {28917#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {28917#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28917#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:09,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {28917#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {28918#(<= main_~i~0 5)} assume true; {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {28918#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {28918#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28918#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:09,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {28918#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {28919#(<= main_~i~0 6)} assume true; {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {28919#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {28919#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28919#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:09,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {28919#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {28920#(<= main_~i~0 7)} assume true; {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {28920#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {28920#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28920#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:09,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {28920#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {28921#(<= main_~i~0 8)} assume true; {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {28921#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28921#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:09,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {28921#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~0 9)} assume true; {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {28922#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,698 INFO L273 TraceCheckUtils]: 44: Hoare triple {28922#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28922#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:09,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {28922#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,699 INFO L273 TraceCheckUtils]: 46: Hoare triple {28923#(<= main_~i~0 10)} assume true; {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,700 INFO L273 TraceCheckUtils]: 47: Hoare triple {28923#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,700 INFO L273 TraceCheckUtils]: 48: Hoare triple {28923#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28923#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:09,701 INFO L273 TraceCheckUtils]: 49: Hoare triple {28923#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {28924#(<= main_~i~0 11)} assume true; {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {28924#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,702 INFO L273 TraceCheckUtils]: 52: Hoare triple {28924#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28924#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:09,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {28924#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {28925#(<= main_~i~0 12)} assume true; {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {28925#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {28925#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28925#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:09,705 INFO L273 TraceCheckUtils]: 57: Hoare triple {28925#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {28926#(<= main_~i~0 13)} assume true; {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {28926#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {28926#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28926#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:09,707 INFO L273 TraceCheckUtils]: 61: Hoare triple {28926#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {28927#(<= main_~i~0 14)} assume true; {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {28927#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {28927#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28927#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:09,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {28927#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {28928#(<= main_~i~0 15)} assume true; {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,710 INFO L273 TraceCheckUtils]: 67: Hoare triple {28928#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,711 INFO L273 TraceCheckUtils]: 68: Hoare triple {28928#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28928#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:09,711 INFO L273 TraceCheckUtils]: 69: Hoare triple {28928#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,712 INFO L273 TraceCheckUtils]: 70: Hoare triple {28929#(<= main_~i~0 16)} assume true; {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {28929#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,713 INFO L273 TraceCheckUtils]: 72: Hoare triple {28929#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28929#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:09,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {28929#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,714 INFO L273 TraceCheckUtils]: 74: Hoare triple {28930#(<= main_~i~0 17)} assume true; {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,714 INFO L273 TraceCheckUtils]: 75: Hoare triple {28930#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,715 INFO L273 TraceCheckUtils]: 76: Hoare triple {28930#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28930#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:09,715 INFO L273 TraceCheckUtils]: 77: Hoare triple {28930#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,716 INFO L273 TraceCheckUtils]: 78: Hoare triple {28931#(<= main_~i~0 18)} assume true; {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,716 INFO L273 TraceCheckUtils]: 79: Hoare triple {28931#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,717 INFO L273 TraceCheckUtils]: 80: Hoare triple {28931#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28931#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:09,718 INFO L273 TraceCheckUtils]: 81: Hoare triple {28931#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,718 INFO L273 TraceCheckUtils]: 82: Hoare triple {28932#(<= main_~i~0 19)} assume true; {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,718 INFO L273 TraceCheckUtils]: 83: Hoare triple {28932#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,719 INFO L273 TraceCheckUtils]: 84: Hoare triple {28932#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28932#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:09,720 INFO L273 TraceCheckUtils]: 85: Hoare triple {28932#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,720 INFO L273 TraceCheckUtils]: 86: Hoare triple {28933#(<= main_~i~0 20)} assume true; {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,720 INFO L273 TraceCheckUtils]: 87: Hoare triple {28933#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,721 INFO L273 TraceCheckUtils]: 88: Hoare triple {28933#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28933#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:09,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {28933#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {28934#(<= main_~i~0 21)} assume true; {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,723 INFO L273 TraceCheckUtils]: 91: Hoare triple {28934#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {28934#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28934#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:09,724 INFO L273 TraceCheckUtils]: 93: Hoare triple {28934#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,724 INFO L273 TraceCheckUtils]: 94: Hoare triple {28935#(<= main_~i~0 22)} assume true; {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,725 INFO L273 TraceCheckUtils]: 95: Hoare triple {28935#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,725 INFO L273 TraceCheckUtils]: 96: Hoare triple {28935#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28935#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:09,726 INFO L273 TraceCheckUtils]: 97: Hoare triple {28935#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,726 INFO L273 TraceCheckUtils]: 98: Hoare triple {28936#(<= main_~i~0 23)} assume true; {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,727 INFO L273 TraceCheckUtils]: 99: Hoare triple {28936#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,727 INFO L273 TraceCheckUtils]: 100: Hoare triple {28936#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28936#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:09,728 INFO L273 TraceCheckUtils]: 101: Hoare triple {28936#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,728 INFO L273 TraceCheckUtils]: 102: Hoare triple {28937#(<= main_~i~0 24)} assume true; {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,729 INFO L273 TraceCheckUtils]: 103: Hoare triple {28937#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,729 INFO L273 TraceCheckUtils]: 104: Hoare triple {28937#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28937#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:09,730 INFO L273 TraceCheckUtils]: 105: Hoare triple {28937#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,730 INFO L273 TraceCheckUtils]: 106: Hoare triple {28938#(<= main_~i~0 25)} assume true; {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,731 INFO L273 TraceCheckUtils]: 107: Hoare triple {28938#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,731 INFO L273 TraceCheckUtils]: 108: Hoare triple {28938#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28938#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:09,732 INFO L273 TraceCheckUtils]: 109: Hoare triple {28938#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,732 INFO L273 TraceCheckUtils]: 110: Hoare triple {28939#(<= main_~i~0 26)} assume true; {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,733 INFO L273 TraceCheckUtils]: 111: Hoare triple {28939#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,733 INFO L273 TraceCheckUtils]: 112: Hoare triple {28939#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28939#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:09,734 INFO L273 TraceCheckUtils]: 113: Hoare triple {28939#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,734 INFO L273 TraceCheckUtils]: 114: Hoare triple {28940#(<= main_~i~0 27)} assume true; {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,735 INFO L273 TraceCheckUtils]: 115: Hoare triple {28940#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,735 INFO L273 TraceCheckUtils]: 116: Hoare triple {28940#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28940#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:09,736 INFO L273 TraceCheckUtils]: 117: Hoare triple {28940#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,736 INFO L273 TraceCheckUtils]: 118: Hoare triple {28941#(<= main_~i~0 28)} assume true; {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,737 INFO L273 TraceCheckUtils]: 119: Hoare triple {28941#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,737 INFO L273 TraceCheckUtils]: 120: Hoare triple {28941#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28941#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:09,738 INFO L273 TraceCheckUtils]: 121: Hoare triple {28941#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,739 INFO L273 TraceCheckUtils]: 122: Hoare triple {28942#(<= main_~i~0 29)} assume true; {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,739 INFO L273 TraceCheckUtils]: 123: Hoare triple {28942#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,739 INFO L273 TraceCheckUtils]: 124: Hoare triple {28942#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28942#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:09,740 INFO L273 TraceCheckUtils]: 125: Hoare triple {28942#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,741 INFO L273 TraceCheckUtils]: 126: Hoare triple {28943#(<= main_~i~0 30)} assume true; {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,741 INFO L273 TraceCheckUtils]: 127: Hoare triple {28943#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,742 INFO L273 TraceCheckUtils]: 128: Hoare triple {28943#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28943#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:09,742 INFO L273 TraceCheckUtils]: 129: Hoare triple {28943#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,743 INFO L273 TraceCheckUtils]: 130: Hoare triple {28944#(<= main_~i~0 31)} assume true; {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,743 INFO L273 TraceCheckUtils]: 131: Hoare triple {28944#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,744 INFO L273 TraceCheckUtils]: 132: Hoare triple {28944#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28944#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:09,744 INFO L273 TraceCheckUtils]: 133: Hoare triple {28944#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,745 INFO L273 TraceCheckUtils]: 134: Hoare triple {28945#(<= main_~i~0 32)} assume true; {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,745 INFO L273 TraceCheckUtils]: 135: Hoare triple {28945#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,746 INFO L273 TraceCheckUtils]: 136: Hoare triple {28945#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28945#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:09,746 INFO L273 TraceCheckUtils]: 137: Hoare triple {28945#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,747 INFO L273 TraceCheckUtils]: 138: Hoare triple {28946#(<= main_~i~0 33)} assume true; {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,747 INFO L273 TraceCheckUtils]: 139: Hoare triple {28946#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,748 INFO L273 TraceCheckUtils]: 140: Hoare triple {28946#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28946#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:09,748 INFO L273 TraceCheckUtils]: 141: Hoare triple {28946#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,749 INFO L273 TraceCheckUtils]: 142: Hoare triple {28947#(<= main_~i~0 34)} assume true; {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,749 INFO L273 TraceCheckUtils]: 143: Hoare triple {28947#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,750 INFO L273 TraceCheckUtils]: 144: Hoare triple {28947#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28947#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:09,750 INFO L273 TraceCheckUtils]: 145: Hoare triple {28947#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,751 INFO L273 TraceCheckUtils]: 146: Hoare triple {28948#(<= main_~i~0 35)} assume true; {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,751 INFO L273 TraceCheckUtils]: 147: Hoare triple {28948#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,752 INFO L273 TraceCheckUtils]: 148: Hoare triple {28948#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28948#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:09,752 INFO L273 TraceCheckUtils]: 149: Hoare triple {28948#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,753 INFO L273 TraceCheckUtils]: 150: Hoare triple {28949#(<= main_~i~0 36)} assume true; {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,753 INFO L273 TraceCheckUtils]: 151: Hoare triple {28949#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,754 INFO L273 TraceCheckUtils]: 152: Hoare triple {28949#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {28949#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:09,754 INFO L273 TraceCheckUtils]: 153: Hoare triple {28949#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28950#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:09,755 INFO L273 TraceCheckUtils]: 154: Hoare triple {28950#(<= main_~i~0 37)} assume true; {28950#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:09,756 INFO L273 TraceCheckUtils]: 155: Hoare triple {28950#(<= main_~i~0 37)} assume !(~i~0 < 100000); {28912#false} is VALID [2018-11-18 22:59:09,756 INFO L273 TraceCheckUtils]: 156: Hoare triple {28912#false} havoc ~x~0;~x~0 := 0; {28912#false} is VALID [2018-11-18 22:59:09,756 INFO L273 TraceCheckUtils]: 157: Hoare triple {28912#false} assume true; {28912#false} is VALID [2018-11-18 22:59:09,756 INFO L273 TraceCheckUtils]: 158: Hoare triple {28912#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {28912#false} is VALID [2018-11-18 22:59:09,756 INFO L256 TraceCheckUtils]: 159: Hoare triple {28912#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {28912#false} is VALID [2018-11-18 22:59:09,756 INFO L273 TraceCheckUtils]: 160: Hoare triple {28912#false} ~cond := #in~cond; {28912#false} is VALID [2018-11-18 22:59:09,757 INFO L273 TraceCheckUtils]: 161: Hoare triple {28912#false} assume 0 == ~cond; {28912#false} is VALID [2018-11-18 22:59:09,757 INFO L273 TraceCheckUtils]: 162: Hoare triple {28912#false} assume !false; {28912#false} is VALID [2018-11-18 22:59:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:09,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:09,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-18 22:59:09,792 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-11-18 22:59:09,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:09,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-18 22:59:09,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:09,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 22:59:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 22:59:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:59:09,946 INFO L87 Difference]: Start difference. First operand 174 states and 214 transitions. Second operand 41 states. [2018-11-18 22:59:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:10,765 INFO L93 Difference]: Finished difference Result 198 states and 243 transitions. [2018-11-18 22:59:10,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-18 22:59:10,765 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-11-18 22:59:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:59:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 243 transitions. [2018-11-18 22:59:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 22:59:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 243 transitions. [2018-11-18 22:59:10,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 243 transitions. [2018-11-18 22:59:10,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:10,997 INFO L225 Difference]: With dead ends: 198 [2018-11-18 22:59:10,997 INFO L226 Difference]: Without dead ends: 180 [2018-11-18 22:59:10,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:59:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-18 22:59:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-11-18 22:59:11,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:11,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand 178 states. [2018-11-18 22:59:11,051 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 178 states. [2018-11-18 22:59:11,051 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 178 states. [2018-11-18 22:59:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:11,054 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2018-11-18 22:59:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2018-11-18 22:59:11,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:11,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:11,055 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 180 states. [2018-11-18 22:59:11,055 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 180 states. [2018-11-18 22:59:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:11,058 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2018-11-18 22:59:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2018-11-18 22:59:11,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:11,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:11,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:11,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-18 22:59:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 219 transitions. [2018-11-18 22:59:11,063 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 219 transitions. Word has length 163 [2018-11-18 22:59:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:11,063 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 219 transitions. [2018-11-18 22:59:11,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 22:59:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2018-11-18 22:59:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 22:59:11,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:11,064 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:11,065 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:11,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash -989945796, now seen corresponding path program 38 times [2018-11-18 22:59:11,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:11,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:11,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:11,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:59:11,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:12,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {30277#true} call ULTIMATE.init(); {30277#true} is VALID [2018-11-18 22:59:12,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {30277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30277#true} is VALID [2018-11-18 22:59:12,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {30277#true} assume true; {30277#true} is VALID [2018-11-18 22:59:12,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30277#true} {30277#true} #73#return; {30277#true} is VALID [2018-11-18 22:59:12,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {30277#true} call #t~ret7 := main(); {30277#true} is VALID [2018-11-18 22:59:12,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {30277#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {30279#(= main_~i~0 0)} is VALID [2018-11-18 22:59:12,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {30279#(= main_~i~0 0)} assume true; {30279#(= main_~i~0 0)} is VALID [2018-11-18 22:59:12,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {30279#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30279#(= main_~i~0 0)} is VALID [2018-11-18 22:59:12,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {30279#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30279#(= main_~i~0 0)} is VALID [2018-11-18 22:59:12,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {30279#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {30280#(<= main_~i~0 1)} assume true; {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {30280#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {30280#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:12,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {30280#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {30281#(<= main_~i~0 2)} assume true; {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {30281#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {30281#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:12,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {30281#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {30282#(<= main_~i~0 3)} assume true; {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {30282#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {30282#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:12,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {30282#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {30283#(<= main_~i~0 4)} assume true; {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {30283#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {30283#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:12,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {30283#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {30284#(<= main_~i~0 5)} assume true; {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {30284#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {30284#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:12,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {30284#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {30285#(<= main_~i~0 6)} assume true; {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {30285#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {30285#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:12,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {30285#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {30286#(<= main_~i~0 7)} assume true; {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {30286#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {30286#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:12,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {30286#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#(<= main_~i~0 8)} assume true; {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {30287#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:12,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {30287#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {30288#(<= main_~i~0 9)} assume true; {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {30288#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,139 INFO L273 TraceCheckUtils]: 44: Hoare triple {30288#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:12,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {30288#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,140 INFO L273 TraceCheckUtils]: 46: Hoare triple {30289#(<= main_~i~0 10)} assume true; {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {30289#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {30289#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:12,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {30289#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,142 INFO L273 TraceCheckUtils]: 50: Hoare triple {30290#(<= main_~i~0 11)} assume true; {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {30290#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,143 INFO L273 TraceCheckUtils]: 52: Hoare triple {30290#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:12,144 INFO L273 TraceCheckUtils]: 53: Hoare triple {30290#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {30291#(<= main_~i~0 12)} assume true; {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {30291#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,145 INFO L273 TraceCheckUtils]: 56: Hoare triple {30291#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:12,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {30291#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {30292#(<= main_~i~0 13)} assume true; {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,147 INFO L273 TraceCheckUtils]: 59: Hoare triple {30292#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {30292#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:12,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {30292#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,149 INFO L273 TraceCheckUtils]: 62: Hoare triple {30293#(<= main_~i~0 14)} assume true; {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,149 INFO L273 TraceCheckUtils]: 63: Hoare triple {30293#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {30293#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:12,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {30293#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,151 INFO L273 TraceCheckUtils]: 66: Hoare triple {30294#(<= main_~i~0 15)} assume true; {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,152 INFO L273 TraceCheckUtils]: 67: Hoare triple {30294#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,152 INFO L273 TraceCheckUtils]: 68: Hoare triple {30294#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:12,153 INFO L273 TraceCheckUtils]: 69: Hoare triple {30294#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,153 INFO L273 TraceCheckUtils]: 70: Hoare triple {30295#(<= main_~i~0 16)} assume true; {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,154 INFO L273 TraceCheckUtils]: 71: Hoare triple {30295#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,154 INFO L273 TraceCheckUtils]: 72: Hoare triple {30295#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:12,155 INFO L273 TraceCheckUtils]: 73: Hoare triple {30295#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,155 INFO L273 TraceCheckUtils]: 74: Hoare triple {30296#(<= main_~i~0 17)} assume true; {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,156 INFO L273 TraceCheckUtils]: 75: Hoare triple {30296#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,156 INFO L273 TraceCheckUtils]: 76: Hoare triple {30296#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:12,157 INFO L273 TraceCheckUtils]: 77: Hoare triple {30296#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,158 INFO L273 TraceCheckUtils]: 78: Hoare triple {30297#(<= main_~i~0 18)} assume true; {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,158 INFO L273 TraceCheckUtils]: 79: Hoare triple {30297#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,159 INFO L273 TraceCheckUtils]: 80: Hoare triple {30297#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:12,159 INFO L273 TraceCheckUtils]: 81: Hoare triple {30297#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,160 INFO L273 TraceCheckUtils]: 82: Hoare triple {30298#(<= main_~i~0 19)} assume true; {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,160 INFO L273 TraceCheckUtils]: 83: Hoare triple {30298#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,161 INFO L273 TraceCheckUtils]: 84: Hoare triple {30298#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:12,161 INFO L273 TraceCheckUtils]: 85: Hoare triple {30298#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,162 INFO L273 TraceCheckUtils]: 86: Hoare triple {30299#(<= main_~i~0 20)} assume true; {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,163 INFO L273 TraceCheckUtils]: 87: Hoare triple {30299#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,163 INFO L273 TraceCheckUtils]: 88: Hoare triple {30299#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:12,164 INFO L273 TraceCheckUtils]: 89: Hoare triple {30299#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,164 INFO L273 TraceCheckUtils]: 90: Hoare triple {30300#(<= main_~i~0 21)} assume true; {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,165 INFO L273 TraceCheckUtils]: 91: Hoare triple {30300#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,165 INFO L273 TraceCheckUtils]: 92: Hoare triple {30300#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:12,166 INFO L273 TraceCheckUtils]: 93: Hoare triple {30300#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,166 INFO L273 TraceCheckUtils]: 94: Hoare triple {30301#(<= main_~i~0 22)} assume true; {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,167 INFO L273 TraceCheckUtils]: 95: Hoare triple {30301#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,167 INFO L273 TraceCheckUtils]: 96: Hoare triple {30301#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:12,168 INFO L273 TraceCheckUtils]: 97: Hoare triple {30301#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,169 INFO L273 TraceCheckUtils]: 98: Hoare triple {30302#(<= main_~i~0 23)} assume true; {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,169 INFO L273 TraceCheckUtils]: 99: Hoare triple {30302#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,170 INFO L273 TraceCheckUtils]: 100: Hoare triple {30302#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:12,170 INFO L273 TraceCheckUtils]: 101: Hoare triple {30302#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,171 INFO L273 TraceCheckUtils]: 102: Hoare triple {30303#(<= main_~i~0 24)} assume true; {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,171 INFO L273 TraceCheckUtils]: 103: Hoare triple {30303#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,172 INFO L273 TraceCheckUtils]: 104: Hoare triple {30303#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:12,173 INFO L273 TraceCheckUtils]: 105: Hoare triple {30303#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,173 INFO L273 TraceCheckUtils]: 106: Hoare triple {30304#(<= main_~i~0 25)} assume true; {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,174 INFO L273 TraceCheckUtils]: 107: Hoare triple {30304#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,174 INFO L273 TraceCheckUtils]: 108: Hoare triple {30304#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:12,175 INFO L273 TraceCheckUtils]: 109: Hoare triple {30304#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,175 INFO L273 TraceCheckUtils]: 110: Hoare triple {30305#(<= main_~i~0 26)} assume true; {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,176 INFO L273 TraceCheckUtils]: 111: Hoare triple {30305#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,176 INFO L273 TraceCheckUtils]: 112: Hoare triple {30305#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:12,177 INFO L273 TraceCheckUtils]: 113: Hoare triple {30305#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,177 INFO L273 TraceCheckUtils]: 114: Hoare triple {30306#(<= main_~i~0 27)} assume true; {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,178 INFO L273 TraceCheckUtils]: 115: Hoare triple {30306#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,178 INFO L273 TraceCheckUtils]: 116: Hoare triple {30306#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:12,179 INFO L273 TraceCheckUtils]: 117: Hoare triple {30306#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,180 INFO L273 TraceCheckUtils]: 118: Hoare triple {30307#(<= main_~i~0 28)} assume true; {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,180 INFO L273 TraceCheckUtils]: 119: Hoare triple {30307#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,181 INFO L273 TraceCheckUtils]: 120: Hoare triple {30307#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:12,181 INFO L273 TraceCheckUtils]: 121: Hoare triple {30307#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,182 INFO L273 TraceCheckUtils]: 122: Hoare triple {30308#(<= main_~i~0 29)} assume true; {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,182 INFO L273 TraceCheckUtils]: 123: Hoare triple {30308#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,183 INFO L273 TraceCheckUtils]: 124: Hoare triple {30308#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:12,184 INFO L273 TraceCheckUtils]: 125: Hoare triple {30308#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,184 INFO L273 TraceCheckUtils]: 126: Hoare triple {30309#(<= main_~i~0 30)} assume true; {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,185 INFO L273 TraceCheckUtils]: 127: Hoare triple {30309#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,185 INFO L273 TraceCheckUtils]: 128: Hoare triple {30309#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:12,186 INFO L273 TraceCheckUtils]: 129: Hoare triple {30309#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,186 INFO L273 TraceCheckUtils]: 130: Hoare triple {30310#(<= main_~i~0 31)} assume true; {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,187 INFO L273 TraceCheckUtils]: 131: Hoare triple {30310#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,187 INFO L273 TraceCheckUtils]: 132: Hoare triple {30310#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:12,188 INFO L273 TraceCheckUtils]: 133: Hoare triple {30310#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,188 INFO L273 TraceCheckUtils]: 134: Hoare triple {30311#(<= main_~i~0 32)} assume true; {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,189 INFO L273 TraceCheckUtils]: 135: Hoare triple {30311#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,189 INFO L273 TraceCheckUtils]: 136: Hoare triple {30311#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:12,190 INFO L273 TraceCheckUtils]: 137: Hoare triple {30311#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,191 INFO L273 TraceCheckUtils]: 138: Hoare triple {30312#(<= main_~i~0 33)} assume true; {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,191 INFO L273 TraceCheckUtils]: 139: Hoare triple {30312#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,191 INFO L273 TraceCheckUtils]: 140: Hoare triple {30312#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:12,192 INFO L273 TraceCheckUtils]: 141: Hoare triple {30312#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,193 INFO L273 TraceCheckUtils]: 142: Hoare triple {30313#(<= main_~i~0 34)} assume true; {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,193 INFO L273 TraceCheckUtils]: 143: Hoare triple {30313#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,193 INFO L273 TraceCheckUtils]: 144: Hoare triple {30313#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:12,194 INFO L273 TraceCheckUtils]: 145: Hoare triple {30313#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,195 INFO L273 TraceCheckUtils]: 146: Hoare triple {30314#(<= main_~i~0 35)} assume true; {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,195 INFO L273 TraceCheckUtils]: 147: Hoare triple {30314#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,196 INFO L273 TraceCheckUtils]: 148: Hoare triple {30314#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:12,196 INFO L273 TraceCheckUtils]: 149: Hoare triple {30314#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,197 INFO L273 TraceCheckUtils]: 150: Hoare triple {30315#(<= main_~i~0 36)} assume true; {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,197 INFO L273 TraceCheckUtils]: 151: Hoare triple {30315#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,198 INFO L273 TraceCheckUtils]: 152: Hoare triple {30315#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:12,198 INFO L273 TraceCheckUtils]: 153: Hoare triple {30315#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,199 INFO L273 TraceCheckUtils]: 154: Hoare triple {30316#(<= main_~i~0 37)} assume true; {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,199 INFO L273 TraceCheckUtils]: 155: Hoare triple {30316#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,200 INFO L273 TraceCheckUtils]: 156: Hoare triple {30316#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:12,200 INFO L273 TraceCheckUtils]: 157: Hoare triple {30316#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30317#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,201 INFO L273 TraceCheckUtils]: 158: Hoare triple {30317#(<= main_~i~0 38)} assume true; {30317#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:12,201 INFO L273 TraceCheckUtils]: 159: Hoare triple {30317#(<= main_~i~0 38)} assume !(~i~0 < 100000); {30278#false} is VALID [2018-11-18 22:59:12,202 INFO L273 TraceCheckUtils]: 160: Hoare triple {30278#false} havoc ~x~0;~x~0 := 0; {30278#false} is VALID [2018-11-18 22:59:12,202 INFO L273 TraceCheckUtils]: 161: Hoare triple {30278#false} assume true; {30278#false} is VALID [2018-11-18 22:59:12,202 INFO L273 TraceCheckUtils]: 162: Hoare triple {30278#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {30278#false} is VALID [2018-11-18 22:59:12,202 INFO L256 TraceCheckUtils]: 163: Hoare triple {30278#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {30278#false} is VALID [2018-11-18 22:59:12,202 INFO L273 TraceCheckUtils]: 164: Hoare triple {30278#false} ~cond := #in~cond; {30278#false} is VALID [2018-11-18 22:59:12,202 INFO L273 TraceCheckUtils]: 165: Hoare triple {30278#false} assume 0 == ~cond; {30278#false} is VALID [2018-11-18 22:59:12,203 INFO L273 TraceCheckUtils]: 166: Hoare triple {30278#false} assume !false; {30278#false} is VALID [2018-11-18 22:59:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:12,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:12,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:12,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:59:12,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:59:12,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:59:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:12,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:13,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {30277#true} call ULTIMATE.init(); {30277#true} is VALID [2018-11-18 22:59:13,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {30277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30277#true} is VALID [2018-11-18 22:59:13,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {30277#true} assume true; {30277#true} is VALID [2018-11-18 22:59:13,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30277#true} {30277#true} #73#return; {30277#true} is VALID [2018-11-18 22:59:13,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {30277#true} call #t~ret7 := main(); {30277#true} is VALID [2018-11-18 22:59:13,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {30277#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {30336#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:13,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {30336#(<= main_~i~0 0)} assume true; {30336#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:13,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {30336#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30336#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:13,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {30336#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30336#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:13,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {30336#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:13,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {30280#(<= main_~i~0 1)} assume true; {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:13,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {30280#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:13,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {30280#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30280#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:13,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {30280#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:13,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {30281#(<= main_~i~0 2)} assume true; {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:13,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {30281#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:13,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {30281#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30281#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:13,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {30281#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:13,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {30282#(<= main_~i~0 3)} assume true; {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:13,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {30282#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:13,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {30282#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30282#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:13,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {30282#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:13,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {30283#(<= main_~i~0 4)} assume true; {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:13,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {30283#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:13,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {30283#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30283#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:13,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {30283#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:13,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {30284#(<= main_~i~0 5)} assume true; {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:13,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {30284#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:13,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {30284#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30284#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:13,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {30284#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:13,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {30285#(<= main_~i~0 6)} assume true; {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:13,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {30285#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:13,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {30285#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30285#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:13,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {30285#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:13,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {30286#(<= main_~i~0 7)} assume true; {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:13,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {30286#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:13,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {30286#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30286#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:13,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {30286#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:13,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#(<= main_~i~0 8)} assume true; {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:13,583 INFO L273 TraceCheckUtils]: 39: Hoare triple {30287#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:13,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30287#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:13,584 INFO L273 TraceCheckUtils]: 41: Hoare triple {30287#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:13,585 INFO L273 TraceCheckUtils]: 42: Hoare triple {30288#(<= main_~i~0 9)} assume true; {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:13,585 INFO L273 TraceCheckUtils]: 43: Hoare triple {30288#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:13,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {30288#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30288#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:13,586 INFO L273 TraceCheckUtils]: 45: Hoare triple {30288#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:13,587 INFO L273 TraceCheckUtils]: 46: Hoare triple {30289#(<= main_~i~0 10)} assume true; {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:13,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {30289#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:13,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {30289#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30289#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:13,589 INFO L273 TraceCheckUtils]: 49: Hoare triple {30289#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:13,589 INFO L273 TraceCheckUtils]: 50: Hoare triple {30290#(<= main_~i~0 11)} assume true; {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:13,590 INFO L273 TraceCheckUtils]: 51: Hoare triple {30290#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:13,590 INFO L273 TraceCheckUtils]: 52: Hoare triple {30290#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30290#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:13,591 INFO L273 TraceCheckUtils]: 53: Hoare triple {30290#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:13,591 INFO L273 TraceCheckUtils]: 54: Hoare triple {30291#(<= main_~i~0 12)} assume true; {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:13,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {30291#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:13,592 INFO L273 TraceCheckUtils]: 56: Hoare triple {30291#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30291#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:13,593 INFO L273 TraceCheckUtils]: 57: Hoare triple {30291#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:13,593 INFO L273 TraceCheckUtils]: 58: Hoare triple {30292#(<= main_~i~0 13)} assume true; {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:13,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {30292#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:13,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {30292#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30292#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:13,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {30292#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:13,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {30293#(<= main_~i~0 14)} assume true; {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:13,596 INFO L273 TraceCheckUtils]: 63: Hoare triple {30293#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:13,596 INFO L273 TraceCheckUtils]: 64: Hoare triple {30293#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30293#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:13,597 INFO L273 TraceCheckUtils]: 65: Hoare triple {30293#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:13,597 INFO L273 TraceCheckUtils]: 66: Hoare triple {30294#(<= main_~i~0 15)} assume true; {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:13,598 INFO L273 TraceCheckUtils]: 67: Hoare triple {30294#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:13,598 INFO L273 TraceCheckUtils]: 68: Hoare triple {30294#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30294#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:13,599 INFO L273 TraceCheckUtils]: 69: Hoare triple {30294#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:13,599 INFO L273 TraceCheckUtils]: 70: Hoare triple {30295#(<= main_~i~0 16)} assume true; {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:13,600 INFO L273 TraceCheckUtils]: 71: Hoare triple {30295#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:13,600 INFO L273 TraceCheckUtils]: 72: Hoare triple {30295#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30295#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:13,601 INFO L273 TraceCheckUtils]: 73: Hoare triple {30295#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:13,601 INFO L273 TraceCheckUtils]: 74: Hoare triple {30296#(<= main_~i~0 17)} assume true; {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:13,602 INFO L273 TraceCheckUtils]: 75: Hoare triple {30296#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:13,602 INFO L273 TraceCheckUtils]: 76: Hoare triple {30296#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30296#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:13,603 INFO L273 TraceCheckUtils]: 77: Hoare triple {30296#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:13,604 INFO L273 TraceCheckUtils]: 78: Hoare triple {30297#(<= main_~i~0 18)} assume true; {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:13,604 INFO L273 TraceCheckUtils]: 79: Hoare triple {30297#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:13,604 INFO L273 TraceCheckUtils]: 80: Hoare triple {30297#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30297#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:13,605 INFO L273 TraceCheckUtils]: 81: Hoare triple {30297#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:13,606 INFO L273 TraceCheckUtils]: 82: Hoare triple {30298#(<= main_~i~0 19)} assume true; {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:13,606 INFO L273 TraceCheckUtils]: 83: Hoare triple {30298#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:13,607 INFO L273 TraceCheckUtils]: 84: Hoare triple {30298#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30298#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:13,607 INFO L273 TraceCheckUtils]: 85: Hoare triple {30298#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:13,608 INFO L273 TraceCheckUtils]: 86: Hoare triple {30299#(<= main_~i~0 20)} assume true; {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:13,608 INFO L273 TraceCheckUtils]: 87: Hoare triple {30299#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:13,609 INFO L273 TraceCheckUtils]: 88: Hoare triple {30299#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30299#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:13,609 INFO L273 TraceCheckUtils]: 89: Hoare triple {30299#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:13,610 INFO L273 TraceCheckUtils]: 90: Hoare triple {30300#(<= main_~i~0 21)} assume true; {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:13,610 INFO L273 TraceCheckUtils]: 91: Hoare triple {30300#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:13,611 INFO L273 TraceCheckUtils]: 92: Hoare triple {30300#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30300#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:13,611 INFO L273 TraceCheckUtils]: 93: Hoare triple {30300#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:13,612 INFO L273 TraceCheckUtils]: 94: Hoare triple {30301#(<= main_~i~0 22)} assume true; {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:13,612 INFO L273 TraceCheckUtils]: 95: Hoare triple {30301#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:13,613 INFO L273 TraceCheckUtils]: 96: Hoare triple {30301#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30301#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:13,613 INFO L273 TraceCheckUtils]: 97: Hoare triple {30301#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:13,614 INFO L273 TraceCheckUtils]: 98: Hoare triple {30302#(<= main_~i~0 23)} assume true; {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:13,614 INFO L273 TraceCheckUtils]: 99: Hoare triple {30302#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:13,615 INFO L273 TraceCheckUtils]: 100: Hoare triple {30302#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30302#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:13,615 INFO L273 TraceCheckUtils]: 101: Hoare triple {30302#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:13,616 INFO L273 TraceCheckUtils]: 102: Hoare triple {30303#(<= main_~i~0 24)} assume true; {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:13,616 INFO L273 TraceCheckUtils]: 103: Hoare triple {30303#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:13,617 INFO L273 TraceCheckUtils]: 104: Hoare triple {30303#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30303#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:13,618 INFO L273 TraceCheckUtils]: 105: Hoare triple {30303#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:13,618 INFO L273 TraceCheckUtils]: 106: Hoare triple {30304#(<= main_~i~0 25)} assume true; {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:13,618 INFO L273 TraceCheckUtils]: 107: Hoare triple {30304#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:13,619 INFO L273 TraceCheckUtils]: 108: Hoare triple {30304#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30304#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:13,620 INFO L273 TraceCheckUtils]: 109: Hoare triple {30304#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:13,620 INFO L273 TraceCheckUtils]: 110: Hoare triple {30305#(<= main_~i~0 26)} assume true; {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:13,621 INFO L273 TraceCheckUtils]: 111: Hoare triple {30305#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:13,621 INFO L273 TraceCheckUtils]: 112: Hoare triple {30305#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30305#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:13,622 INFO L273 TraceCheckUtils]: 113: Hoare triple {30305#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:13,622 INFO L273 TraceCheckUtils]: 114: Hoare triple {30306#(<= main_~i~0 27)} assume true; {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:13,623 INFO L273 TraceCheckUtils]: 115: Hoare triple {30306#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:13,623 INFO L273 TraceCheckUtils]: 116: Hoare triple {30306#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30306#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:13,624 INFO L273 TraceCheckUtils]: 117: Hoare triple {30306#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:13,624 INFO L273 TraceCheckUtils]: 118: Hoare triple {30307#(<= main_~i~0 28)} assume true; {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:13,625 INFO L273 TraceCheckUtils]: 119: Hoare triple {30307#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:13,625 INFO L273 TraceCheckUtils]: 120: Hoare triple {30307#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30307#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:13,626 INFO L273 TraceCheckUtils]: 121: Hoare triple {30307#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:13,626 INFO L273 TraceCheckUtils]: 122: Hoare triple {30308#(<= main_~i~0 29)} assume true; {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:13,627 INFO L273 TraceCheckUtils]: 123: Hoare triple {30308#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:13,627 INFO L273 TraceCheckUtils]: 124: Hoare triple {30308#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30308#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:13,628 INFO L273 TraceCheckUtils]: 125: Hoare triple {30308#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:13,628 INFO L273 TraceCheckUtils]: 126: Hoare triple {30309#(<= main_~i~0 30)} assume true; {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:13,629 INFO L273 TraceCheckUtils]: 127: Hoare triple {30309#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:13,629 INFO L273 TraceCheckUtils]: 128: Hoare triple {30309#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30309#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:13,630 INFO L273 TraceCheckUtils]: 129: Hoare triple {30309#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:13,630 INFO L273 TraceCheckUtils]: 130: Hoare triple {30310#(<= main_~i~0 31)} assume true; {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:13,631 INFO L273 TraceCheckUtils]: 131: Hoare triple {30310#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:13,631 INFO L273 TraceCheckUtils]: 132: Hoare triple {30310#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30310#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:13,632 INFO L273 TraceCheckUtils]: 133: Hoare triple {30310#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:13,633 INFO L273 TraceCheckUtils]: 134: Hoare triple {30311#(<= main_~i~0 32)} assume true; {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:13,633 INFO L273 TraceCheckUtils]: 135: Hoare triple {30311#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:13,634 INFO L273 TraceCheckUtils]: 136: Hoare triple {30311#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30311#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:13,635 INFO L273 TraceCheckUtils]: 137: Hoare triple {30311#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:13,636 INFO L273 TraceCheckUtils]: 138: Hoare triple {30312#(<= main_~i~0 33)} assume true; {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:13,637 INFO L273 TraceCheckUtils]: 139: Hoare triple {30312#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:13,638 INFO L273 TraceCheckUtils]: 140: Hoare triple {30312#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30312#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:13,638 INFO L273 TraceCheckUtils]: 141: Hoare triple {30312#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:13,639 INFO L273 TraceCheckUtils]: 142: Hoare triple {30313#(<= main_~i~0 34)} assume true; {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:13,639 INFO L273 TraceCheckUtils]: 143: Hoare triple {30313#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:13,639 INFO L273 TraceCheckUtils]: 144: Hoare triple {30313#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30313#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:13,640 INFO L273 TraceCheckUtils]: 145: Hoare triple {30313#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:13,640 INFO L273 TraceCheckUtils]: 146: Hoare triple {30314#(<= main_~i~0 35)} assume true; {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:13,642 INFO L273 TraceCheckUtils]: 147: Hoare triple {30314#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:13,642 INFO L273 TraceCheckUtils]: 148: Hoare triple {30314#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30314#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:13,643 INFO L273 TraceCheckUtils]: 149: Hoare triple {30314#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:13,643 INFO L273 TraceCheckUtils]: 150: Hoare triple {30315#(<= main_~i~0 36)} assume true; {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:13,644 INFO L273 TraceCheckUtils]: 151: Hoare triple {30315#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:13,644 INFO L273 TraceCheckUtils]: 152: Hoare triple {30315#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30315#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:13,644 INFO L273 TraceCheckUtils]: 153: Hoare triple {30315#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:13,645 INFO L273 TraceCheckUtils]: 154: Hoare triple {30316#(<= main_~i~0 37)} assume true; {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:13,645 INFO L273 TraceCheckUtils]: 155: Hoare triple {30316#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:13,645 INFO L273 TraceCheckUtils]: 156: Hoare triple {30316#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {30316#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:13,646 INFO L273 TraceCheckUtils]: 157: Hoare triple {30316#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {30317#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:13,646 INFO L273 TraceCheckUtils]: 158: Hoare triple {30317#(<= main_~i~0 38)} assume true; {30317#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:13,647 INFO L273 TraceCheckUtils]: 159: Hoare triple {30317#(<= main_~i~0 38)} assume !(~i~0 < 100000); {30278#false} is VALID [2018-11-18 22:59:13,647 INFO L273 TraceCheckUtils]: 160: Hoare triple {30278#false} havoc ~x~0;~x~0 := 0; {30278#false} is VALID [2018-11-18 22:59:13,647 INFO L273 TraceCheckUtils]: 161: Hoare triple {30278#false} assume true; {30278#false} is VALID [2018-11-18 22:59:13,647 INFO L273 TraceCheckUtils]: 162: Hoare triple {30278#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {30278#false} is VALID [2018-11-18 22:59:13,648 INFO L256 TraceCheckUtils]: 163: Hoare triple {30278#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {30278#false} is VALID [2018-11-18 22:59:13,648 INFO L273 TraceCheckUtils]: 164: Hoare triple {30278#false} ~cond := #in~cond; {30278#false} is VALID [2018-11-18 22:59:13,648 INFO L273 TraceCheckUtils]: 165: Hoare triple {30278#false} assume 0 == ~cond; {30278#false} is VALID [2018-11-18 22:59:13,648 INFO L273 TraceCheckUtils]: 166: Hoare triple {30278#false} assume !false; {30278#false} is VALID [2018-11-18 22:59:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:13,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:13,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-18 22:59:13,685 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 167 [2018-11-18 22:59:13,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:13,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-18 22:59:13,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:13,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-18 22:59:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-18 22:59:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:59:13,896 INFO L87 Difference]: Start difference. First operand 178 states and 219 transitions. Second operand 42 states. [2018-11-18 22:59:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:14,974 INFO L93 Difference]: Finished difference Result 202 states and 248 transitions. [2018-11-18 22:59:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 22:59:14,974 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 167 [2018-11-18 22:59:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:59:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 248 transitions. [2018-11-18 22:59:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 22:59:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 248 transitions. [2018-11-18 22:59:14,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 248 transitions. [2018-11-18 22:59:15,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:15,193 INFO L225 Difference]: With dead ends: 202 [2018-11-18 22:59:15,193 INFO L226 Difference]: Without dead ends: 184 [2018-11-18 22:59:15,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 22:59:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-18 22:59:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-11-18 22:59:15,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:15,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 182 states. [2018-11-18 22:59:15,231 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 182 states. [2018-11-18 22:59:15,231 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 182 states. [2018-11-18 22:59:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:15,235 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2018-11-18 22:59:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2018-11-18 22:59:15,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:15,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:15,235 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 184 states. [2018-11-18 22:59:15,235 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 184 states. [2018-11-18 22:59:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:15,238 INFO L93 Difference]: Finished difference Result 184 states and 227 transitions. [2018-11-18 22:59:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 227 transitions. [2018-11-18 22:59:15,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:15,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:15,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:15,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 22:59:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2018-11-18 22:59:15,241 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 167 [2018-11-18 22:59:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:15,241 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2018-11-18 22:59:15,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-18 22:59:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-18 22:59:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-18 22:59:15,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:15,242 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:15,242 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:15,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1925524141, now seen corresponding path program 39 times [2018-11-18 22:59:15,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:15,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:59:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:16,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {31674#true} call ULTIMATE.init(); {31674#true} is VALID [2018-11-18 22:59:16,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {31674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31674#true} is VALID [2018-11-18 22:59:16,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {31674#true} assume true; {31674#true} is VALID [2018-11-18 22:59:16,109 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31674#true} {31674#true} #73#return; {31674#true} is VALID [2018-11-18 22:59:16,109 INFO L256 TraceCheckUtils]: 4: Hoare triple {31674#true} call #t~ret7 := main(); {31674#true} is VALID [2018-11-18 22:59:16,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {31674#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {31676#(= main_~i~0 0)} is VALID [2018-11-18 22:59:16,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {31676#(= main_~i~0 0)} assume true; {31676#(= main_~i~0 0)} is VALID [2018-11-18 22:59:16,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {31676#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31676#(= main_~i~0 0)} is VALID [2018-11-18 22:59:16,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {31676#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31676#(= main_~i~0 0)} is VALID [2018-11-18 22:59:16,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {31676#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:16,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {31677#(<= main_~i~0 1)} assume true; {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:16,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {31677#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:16,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {31677#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:16,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {31677#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:16,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {31678#(<= main_~i~0 2)} assume true; {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:16,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {31678#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:16,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {31678#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:16,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {31678#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:16,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {31679#(<= main_~i~0 3)} assume true; {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:16,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {31679#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:16,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {31679#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:16,117 INFO L273 TraceCheckUtils]: 21: Hoare triple {31679#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:16,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {31680#(<= main_~i~0 4)} assume true; {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:16,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {31680#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:16,119 INFO L273 TraceCheckUtils]: 24: Hoare triple {31680#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:16,119 INFO L273 TraceCheckUtils]: 25: Hoare triple {31680#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:16,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {31681#(<= main_~i~0 5)} assume true; {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:16,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {31681#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:16,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {31681#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:16,122 INFO L273 TraceCheckUtils]: 29: Hoare triple {31681#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:16,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {31682#(<= main_~i~0 6)} assume true; {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:16,123 INFO L273 TraceCheckUtils]: 31: Hoare triple {31682#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:16,123 INFO L273 TraceCheckUtils]: 32: Hoare triple {31682#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:16,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {31682#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:16,124 INFO L273 TraceCheckUtils]: 34: Hoare triple {31683#(<= main_~i~0 7)} assume true; {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:16,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {31683#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:16,125 INFO L273 TraceCheckUtils]: 36: Hoare triple {31683#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:16,126 INFO L273 TraceCheckUtils]: 37: Hoare triple {31683#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:16,127 INFO L273 TraceCheckUtils]: 38: Hoare triple {31684#(<= main_~i~0 8)} assume true; {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:16,127 INFO L273 TraceCheckUtils]: 39: Hoare triple {31684#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:16,128 INFO L273 TraceCheckUtils]: 40: Hoare triple {31684#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:16,128 INFO L273 TraceCheckUtils]: 41: Hoare triple {31684#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:16,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {31685#(<= main_~i~0 9)} assume true; {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:16,129 INFO L273 TraceCheckUtils]: 43: Hoare triple {31685#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:16,130 INFO L273 TraceCheckUtils]: 44: Hoare triple {31685#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:16,130 INFO L273 TraceCheckUtils]: 45: Hoare triple {31685#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:16,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {31686#(<= main_~i~0 10)} assume true; {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:16,131 INFO L273 TraceCheckUtils]: 47: Hoare triple {31686#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:16,132 INFO L273 TraceCheckUtils]: 48: Hoare triple {31686#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:16,133 INFO L273 TraceCheckUtils]: 49: Hoare triple {31686#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:16,133 INFO L273 TraceCheckUtils]: 50: Hoare triple {31687#(<= main_~i~0 11)} assume true; {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:16,134 INFO L273 TraceCheckUtils]: 51: Hoare triple {31687#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:16,134 INFO L273 TraceCheckUtils]: 52: Hoare triple {31687#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:16,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {31687#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:16,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {31688#(<= main_~i~0 12)} assume true; {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:16,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {31688#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:16,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {31688#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:16,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {31688#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:16,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {31689#(<= main_~i~0 13)} assume true; {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:16,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {31689#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:16,139 INFO L273 TraceCheckUtils]: 60: Hoare triple {31689#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:16,139 INFO L273 TraceCheckUtils]: 61: Hoare triple {31689#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:16,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {31690#(<= main_~i~0 14)} assume true; {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:16,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {31690#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:16,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {31690#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:16,142 INFO L273 TraceCheckUtils]: 65: Hoare triple {31690#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:16,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {31691#(<= main_~i~0 15)} assume true; {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:16,143 INFO L273 TraceCheckUtils]: 67: Hoare triple {31691#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:16,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {31691#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:16,144 INFO L273 TraceCheckUtils]: 69: Hoare triple {31691#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:16,144 INFO L273 TraceCheckUtils]: 70: Hoare triple {31692#(<= main_~i~0 16)} assume true; {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:16,145 INFO L273 TraceCheckUtils]: 71: Hoare triple {31692#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:16,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {31692#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:16,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {31692#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:16,147 INFO L273 TraceCheckUtils]: 74: Hoare triple {31693#(<= main_~i~0 17)} assume true; {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:16,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {31693#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:16,148 INFO L273 TraceCheckUtils]: 76: Hoare triple {31693#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:16,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {31693#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:16,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {31694#(<= main_~i~0 18)} assume true; {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:16,149 INFO L273 TraceCheckUtils]: 79: Hoare triple {31694#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:16,150 INFO L273 TraceCheckUtils]: 80: Hoare triple {31694#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:16,151 INFO L273 TraceCheckUtils]: 81: Hoare triple {31694#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:16,151 INFO L273 TraceCheckUtils]: 82: Hoare triple {31695#(<= main_~i~0 19)} assume true; {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:16,152 INFO L273 TraceCheckUtils]: 83: Hoare triple {31695#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:16,152 INFO L273 TraceCheckUtils]: 84: Hoare triple {31695#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:16,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {31695#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:16,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {31696#(<= main_~i~0 20)} assume true; {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:16,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {31696#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:16,154 INFO L273 TraceCheckUtils]: 88: Hoare triple {31696#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:16,155 INFO L273 TraceCheckUtils]: 89: Hoare triple {31696#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:16,156 INFO L273 TraceCheckUtils]: 90: Hoare triple {31697#(<= main_~i~0 21)} assume true; {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:16,156 INFO L273 TraceCheckUtils]: 91: Hoare triple {31697#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:16,156 INFO L273 TraceCheckUtils]: 92: Hoare triple {31697#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:16,157 INFO L273 TraceCheckUtils]: 93: Hoare triple {31697#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:16,158 INFO L273 TraceCheckUtils]: 94: Hoare triple {31698#(<= main_~i~0 22)} assume true; {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:16,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {31698#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:16,159 INFO L273 TraceCheckUtils]: 96: Hoare triple {31698#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:16,159 INFO L273 TraceCheckUtils]: 97: Hoare triple {31698#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:16,160 INFO L273 TraceCheckUtils]: 98: Hoare triple {31699#(<= main_~i~0 23)} assume true; {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:16,160 INFO L273 TraceCheckUtils]: 99: Hoare triple {31699#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:16,161 INFO L273 TraceCheckUtils]: 100: Hoare triple {31699#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:16,162 INFO L273 TraceCheckUtils]: 101: Hoare triple {31699#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:16,162 INFO L273 TraceCheckUtils]: 102: Hoare triple {31700#(<= main_~i~0 24)} assume true; {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:16,163 INFO L273 TraceCheckUtils]: 103: Hoare triple {31700#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:16,163 INFO L273 TraceCheckUtils]: 104: Hoare triple {31700#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:16,164 INFO L273 TraceCheckUtils]: 105: Hoare triple {31700#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:16,164 INFO L273 TraceCheckUtils]: 106: Hoare triple {31701#(<= main_~i~0 25)} assume true; {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:16,165 INFO L273 TraceCheckUtils]: 107: Hoare triple {31701#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:16,165 INFO L273 TraceCheckUtils]: 108: Hoare triple {31701#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:16,166 INFO L273 TraceCheckUtils]: 109: Hoare triple {31701#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:16,167 INFO L273 TraceCheckUtils]: 110: Hoare triple {31702#(<= main_~i~0 26)} assume true; {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:16,167 INFO L273 TraceCheckUtils]: 111: Hoare triple {31702#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:16,168 INFO L273 TraceCheckUtils]: 112: Hoare triple {31702#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:16,168 INFO L273 TraceCheckUtils]: 113: Hoare triple {31702#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:16,169 INFO L273 TraceCheckUtils]: 114: Hoare triple {31703#(<= main_~i~0 27)} assume true; {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:16,169 INFO L273 TraceCheckUtils]: 115: Hoare triple {31703#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:16,170 INFO L273 TraceCheckUtils]: 116: Hoare triple {31703#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:16,171 INFO L273 TraceCheckUtils]: 117: Hoare triple {31703#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:16,171 INFO L273 TraceCheckUtils]: 118: Hoare triple {31704#(<= main_~i~0 28)} assume true; {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:16,172 INFO L273 TraceCheckUtils]: 119: Hoare triple {31704#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:16,172 INFO L273 TraceCheckUtils]: 120: Hoare triple {31704#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:16,173 INFO L273 TraceCheckUtils]: 121: Hoare triple {31704#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:16,173 INFO L273 TraceCheckUtils]: 122: Hoare triple {31705#(<= main_~i~0 29)} assume true; {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:16,174 INFO L273 TraceCheckUtils]: 123: Hoare triple {31705#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:16,174 INFO L273 TraceCheckUtils]: 124: Hoare triple {31705#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:16,175 INFO L273 TraceCheckUtils]: 125: Hoare triple {31705#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:16,176 INFO L273 TraceCheckUtils]: 126: Hoare triple {31706#(<= main_~i~0 30)} assume true; {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:16,176 INFO L273 TraceCheckUtils]: 127: Hoare triple {31706#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:16,177 INFO L273 TraceCheckUtils]: 128: Hoare triple {31706#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:16,177 INFO L273 TraceCheckUtils]: 129: Hoare triple {31706#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:16,178 INFO L273 TraceCheckUtils]: 130: Hoare triple {31707#(<= main_~i~0 31)} assume true; {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:16,178 INFO L273 TraceCheckUtils]: 131: Hoare triple {31707#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:16,179 INFO L273 TraceCheckUtils]: 132: Hoare triple {31707#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:16,180 INFO L273 TraceCheckUtils]: 133: Hoare triple {31707#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:16,180 INFO L273 TraceCheckUtils]: 134: Hoare triple {31708#(<= main_~i~0 32)} assume true; {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:16,181 INFO L273 TraceCheckUtils]: 135: Hoare triple {31708#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:16,181 INFO L273 TraceCheckUtils]: 136: Hoare triple {31708#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:16,182 INFO L273 TraceCheckUtils]: 137: Hoare triple {31708#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:16,182 INFO L273 TraceCheckUtils]: 138: Hoare triple {31709#(<= main_~i~0 33)} assume true; {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:16,183 INFO L273 TraceCheckUtils]: 139: Hoare triple {31709#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:16,183 INFO L273 TraceCheckUtils]: 140: Hoare triple {31709#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:16,184 INFO L273 TraceCheckUtils]: 141: Hoare triple {31709#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:16,185 INFO L273 TraceCheckUtils]: 142: Hoare triple {31710#(<= main_~i~0 34)} assume true; {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:16,185 INFO L273 TraceCheckUtils]: 143: Hoare triple {31710#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:16,186 INFO L273 TraceCheckUtils]: 144: Hoare triple {31710#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:16,186 INFO L273 TraceCheckUtils]: 145: Hoare triple {31710#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:16,187 INFO L273 TraceCheckUtils]: 146: Hoare triple {31711#(<= main_~i~0 35)} assume true; {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:16,187 INFO L273 TraceCheckUtils]: 147: Hoare triple {31711#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:16,188 INFO L273 TraceCheckUtils]: 148: Hoare triple {31711#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:16,189 INFO L273 TraceCheckUtils]: 149: Hoare triple {31711#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:16,189 INFO L273 TraceCheckUtils]: 150: Hoare triple {31712#(<= main_~i~0 36)} assume true; {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:16,190 INFO L273 TraceCheckUtils]: 151: Hoare triple {31712#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:16,190 INFO L273 TraceCheckUtils]: 152: Hoare triple {31712#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:16,191 INFO L273 TraceCheckUtils]: 153: Hoare triple {31712#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:16,191 INFO L273 TraceCheckUtils]: 154: Hoare triple {31713#(<= main_~i~0 37)} assume true; {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:16,192 INFO L273 TraceCheckUtils]: 155: Hoare triple {31713#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:16,192 INFO L273 TraceCheckUtils]: 156: Hoare triple {31713#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:16,193 INFO L273 TraceCheckUtils]: 157: Hoare triple {31713#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:16,194 INFO L273 TraceCheckUtils]: 158: Hoare triple {31714#(<= main_~i~0 38)} assume true; {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:16,194 INFO L273 TraceCheckUtils]: 159: Hoare triple {31714#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:16,195 INFO L273 TraceCheckUtils]: 160: Hoare triple {31714#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:16,195 INFO L273 TraceCheckUtils]: 161: Hoare triple {31714#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31715#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:16,196 INFO L273 TraceCheckUtils]: 162: Hoare triple {31715#(<= main_~i~0 39)} assume true; {31715#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:16,196 INFO L273 TraceCheckUtils]: 163: Hoare triple {31715#(<= main_~i~0 39)} assume !(~i~0 < 100000); {31675#false} is VALID [2018-11-18 22:59:16,197 INFO L273 TraceCheckUtils]: 164: Hoare triple {31675#false} havoc ~x~0;~x~0 := 0; {31675#false} is VALID [2018-11-18 22:59:16,197 INFO L273 TraceCheckUtils]: 165: Hoare triple {31675#false} assume true; {31675#false} is VALID [2018-11-18 22:59:16,197 INFO L273 TraceCheckUtils]: 166: Hoare triple {31675#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {31675#false} is VALID [2018-11-18 22:59:16,197 INFO L256 TraceCheckUtils]: 167: Hoare triple {31675#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {31675#false} is VALID [2018-11-18 22:59:16,197 INFO L273 TraceCheckUtils]: 168: Hoare triple {31675#false} ~cond := #in~cond; {31675#false} is VALID [2018-11-18 22:59:16,198 INFO L273 TraceCheckUtils]: 169: Hoare triple {31675#false} assume 0 == ~cond; {31675#false} is VALID [2018-11-18 22:59:16,198 INFO L273 TraceCheckUtils]: 170: Hoare triple {31675#false} assume !false; {31675#false} is VALID [2018-11-18 22:59:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:16,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:16,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:16,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:59:35,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-18 22:59:35,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:59:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:35,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:59:36,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {31674#true} call ULTIMATE.init(); {31674#true} is VALID [2018-11-18 22:59:36,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {31674#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31674#true} is VALID [2018-11-18 22:59:36,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {31674#true} assume true; {31674#true} is VALID [2018-11-18 22:59:36,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31674#true} {31674#true} #73#return; {31674#true} is VALID [2018-11-18 22:59:36,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {31674#true} call #t~ret7 := main(); {31674#true} is VALID [2018-11-18 22:59:36,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {31674#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {31734#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:36,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {31734#(<= main_~i~0 0)} assume true; {31734#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:36,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {31734#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31734#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:36,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {31734#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31734#(<= main_~i~0 0)} is VALID [2018-11-18 22:59:36,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {31734#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:36,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {31677#(<= main_~i~0 1)} assume true; {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:36,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {31677#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:36,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {31677#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31677#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:36,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {31677#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:36,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {31678#(<= main_~i~0 2)} assume true; {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:36,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {31678#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:36,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {31678#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31678#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:36,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {31678#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:36,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {31679#(<= main_~i~0 3)} assume true; {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:36,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {31679#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:36,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {31679#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31679#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:36,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {31679#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:36,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {31680#(<= main_~i~0 4)} assume true; {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:36,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {31680#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:36,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {31680#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31680#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:36,272 INFO L273 TraceCheckUtils]: 25: Hoare triple {31680#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:36,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {31681#(<= main_~i~0 5)} assume true; {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:36,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {31681#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:36,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {31681#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31681#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:36,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {31681#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:36,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {31682#(<= main_~i~0 6)} assume true; {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:36,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {31682#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:36,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {31682#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31682#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:36,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {31682#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:36,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {31683#(<= main_~i~0 7)} assume true; {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:36,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {31683#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:36,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {31683#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31683#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:36,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {31683#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:36,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {31684#(<= main_~i~0 8)} assume true; {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:36,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {31684#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:36,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {31684#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31684#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:36,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {31684#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:36,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {31685#(<= main_~i~0 9)} assume true; {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:36,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {31685#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:36,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {31685#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31685#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:36,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {31685#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:36,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {31686#(<= main_~i~0 10)} assume true; {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:36,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {31686#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:36,284 INFO L273 TraceCheckUtils]: 48: Hoare triple {31686#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31686#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:36,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {31686#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:36,285 INFO L273 TraceCheckUtils]: 50: Hoare triple {31687#(<= main_~i~0 11)} assume true; {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:36,286 INFO L273 TraceCheckUtils]: 51: Hoare triple {31687#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:36,286 INFO L273 TraceCheckUtils]: 52: Hoare triple {31687#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31687#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:36,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {31687#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:36,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {31688#(<= main_~i~0 12)} assume true; {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:36,288 INFO L273 TraceCheckUtils]: 55: Hoare triple {31688#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:36,289 INFO L273 TraceCheckUtils]: 56: Hoare triple {31688#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31688#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:36,289 INFO L273 TraceCheckUtils]: 57: Hoare triple {31688#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:36,290 INFO L273 TraceCheckUtils]: 58: Hoare triple {31689#(<= main_~i~0 13)} assume true; {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:36,290 INFO L273 TraceCheckUtils]: 59: Hoare triple {31689#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:36,291 INFO L273 TraceCheckUtils]: 60: Hoare triple {31689#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31689#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:36,291 INFO L273 TraceCheckUtils]: 61: Hoare triple {31689#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:36,292 INFO L273 TraceCheckUtils]: 62: Hoare triple {31690#(<= main_~i~0 14)} assume true; {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:36,292 INFO L273 TraceCheckUtils]: 63: Hoare triple {31690#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:36,293 INFO L273 TraceCheckUtils]: 64: Hoare triple {31690#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31690#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:36,294 INFO L273 TraceCheckUtils]: 65: Hoare triple {31690#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:36,294 INFO L273 TraceCheckUtils]: 66: Hoare triple {31691#(<= main_~i~0 15)} assume true; {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:36,294 INFO L273 TraceCheckUtils]: 67: Hoare triple {31691#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:36,295 INFO L273 TraceCheckUtils]: 68: Hoare triple {31691#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31691#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:36,296 INFO L273 TraceCheckUtils]: 69: Hoare triple {31691#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:36,296 INFO L273 TraceCheckUtils]: 70: Hoare triple {31692#(<= main_~i~0 16)} assume true; {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:36,297 INFO L273 TraceCheckUtils]: 71: Hoare triple {31692#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:36,297 INFO L273 TraceCheckUtils]: 72: Hoare triple {31692#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31692#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:36,298 INFO L273 TraceCheckUtils]: 73: Hoare triple {31692#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:36,298 INFO L273 TraceCheckUtils]: 74: Hoare triple {31693#(<= main_~i~0 17)} assume true; {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:36,299 INFO L273 TraceCheckUtils]: 75: Hoare triple {31693#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:36,299 INFO L273 TraceCheckUtils]: 76: Hoare triple {31693#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31693#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:36,300 INFO L273 TraceCheckUtils]: 77: Hoare triple {31693#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:36,300 INFO L273 TraceCheckUtils]: 78: Hoare triple {31694#(<= main_~i~0 18)} assume true; {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:36,301 INFO L273 TraceCheckUtils]: 79: Hoare triple {31694#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:36,301 INFO L273 TraceCheckUtils]: 80: Hoare triple {31694#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31694#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:36,302 INFO L273 TraceCheckUtils]: 81: Hoare triple {31694#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:36,302 INFO L273 TraceCheckUtils]: 82: Hoare triple {31695#(<= main_~i~0 19)} assume true; {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:36,303 INFO L273 TraceCheckUtils]: 83: Hoare triple {31695#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:36,303 INFO L273 TraceCheckUtils]: 84: Hoare triple {31695#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31695#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:36,304 INFO L273 TraceCheckUtils]: 85: Hoare triple {31695#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:36,304 INFO L273 TraceCheckUtils]: 86: Hoare triple {31696#(<= main_~i~0 20)} assume true; {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:36,305 INFO L273 TraceCheckUtils]: 87: Hoare triple {31696#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:36,305 INFO L273 TraceCheckUtils]: 88: Hoare triple {31696#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31696#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:36,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {31696#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:36,306 INFO L273 TraceCheckUtils]: 90: Hoare triple {31697#(<= main_~i~0 21)} assume true; {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:36,307 INFO L273 TraceCheckUtils]: 91: Hoare triple {31697#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:36,307 INFO L273 TraceCheckUtils]: 92: Hoare triple {31697#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31697#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:36,308 INFO L273 TraceCheckUtils]: 93: Hoare triple {31697#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:36,309 INFO L273 TraceCheckUtils]: 94: Hoare triple {31698#(<= main_~i~0 22)} assume true; {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:36,309 INFO L273 TraceCheckUtils]: 95: Hoare triple {31698#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:36,310 INFO L273 TraceCheckUtils]: 96: Hoare triple {31698#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31698#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:36,310 INFO L273 TraceCheckUtils]: 97: Hoare triple {31698#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:36,311 INFO L273 TraceCheckUtils]: 98: Hoare triple {31699#(<= main_~i~0 23)} assume true; {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:36,311 INFO L273 TraceCheckUtils]: 99: Hoare triple {31699#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:36,312 INFO L273 TraceCheckUtils]: 100: Hoare triple {31699#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31699#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:36,313 INFO L273 TraceCheckUtils]: 101: Hoare triple {31699#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:36,313 INFO L273 TraceCheckUtils]: 102: Hoare triple {31700#(<= main_~i~0 24)} assume true; {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:36,314 INFO L273 TraceCheckUtils]: 103: Hoare triple {31700#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:36,314 INFO L273 TraceCheckUtils]: 104: Hoare triple {31700#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31700#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:36,315 INFO L273 TraceCheckUtils]: 105: Hoare triple {31700#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:36,315 INFO L273 TraceCheckUtils]: 106: Hoare triple {31701#(<= main_~i~0 25)} assume true; {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:36,316 INFO L273 TraceCheckUtils]: 107: Hoare triple {31701#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:36,316 INFO L273 TraceCheckUtils]: 108: Hoare triple {31701#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31701#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:36,317 INFO L273 TraceCheckUtils]: 109: Hoare triple {31701#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:36,317 INFO L273 TraceCheckUtils]: 110: Hoare triple {31702#(<= main_~i~0 26)} assume true; {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:36,318 INFO L273 TraceCheckUtils]: 111: Hoare triple {31702#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:36,318 INFO L273 TraceCheckUtils]: 112: Hoare triple {31702#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31702#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:36,319 INFO L273 TraceCheckUtils]: 113: Hoare triple {31702#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:36,320 INFO L273 TraceCheckUtils]: 114: Hoare triple {31703#(<= main_~i~0 27)} assume true; {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:36,320 INFO L273 TraceCheckUtils]: 115: Hoare triple {31703#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:36,321 INFO L273 TraceCheckUtils]: 116: Hoare triple {31703#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31703#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:36,321 INFO L273 TraceCheckUtils]: 117: Hoare triple {31703#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:36,322 INFO L273 TraceCheckUtils]: 118: Hoare triple {31704#(<= main_~i~0 28)} assume true; {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:36,322 INFO L273 TraceCheckUtils]: 119: Hoare triple {31704#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:36,323 INFO L273 TraceCheckUtils]: 120: Hoare triple {31704#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31704#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:36,324 INFO L273 TraceCheckUtils]: 121: Hoare triple {31704#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:36,324 INFO L273 TraceCheckUtils]: 122: Hoare triple {31705#(<= main_~i~0 29)} assume true; {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:36,325 INFO L273 TraceCheckUtils]: 123: Hoare triple {31705#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:36,325 INFO L273 TraceCheckUtils]: 124: Hoare triple {31705#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31705#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:36,326 INFO L273 TraceCheckUtils]: 125: Hoare triple {31705#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:36,327 INFO L273 TraceCheckUtils]: 126: Hoare triple {31706#(<= main_~i~0 30)} assume true; {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:36,327 INFO L273 TraceCheckUtils]: 127: Hoare triple {31706#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:36,328 INFO L273 TraceCheckUtils]: 128: Hoare triple {31706#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31706#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:36,328 INFO L273 TraceCheckUtils]: 129: Hoare triple {31706#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:36,329 INFO L273 TraceCheckUtils]: 130: Hoare triple {31707#(<= main_~i~0 31)} assume true; {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:36,329 INFO L273 TraceCheckUtils]: 131: Hoare triple {31707#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:36,330 INFO L273 TraceCheckUtils]: 132: Hoare triple {31707#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31707#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:36,331 INFO L273 TraceCheckUtils]: 133: Hoare triple {31707#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:36,331 INFO L273 TraceCheckUtils]: 134: Hoare triple {31708#(<= main_~i~0 32)} assume true; {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:36,332 INFO L273 TraceCheckUtils]: 135: Hoare triple {31708#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:36,332 INFO L273 TraceCheckUtils]: 136: Hoare triple {31708#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31708#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:36,333 INFO L273 TraceCheckUtils]: 137: Hoare triple {31708#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:36,333 INFO L273 TraceCheckUtils]: 138: Hoare triple {31709#(<= main_~i~0 33)} assume true; {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:36,334 INFO L273 TraceCheckUtils]: 139: Hoare triple {31709#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:36,334 INFO L273 TraceCheckUtils]: 140: Hoare triple {31709#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31709#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:36,335 INFO L273 TraceCheckUtils]: 141: Hoare triple {31709#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:36,336 INFO L273 TraceCheckUtils]: 142: Hoare triple {31710#(<= main_~i~0 34)} assume true; {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:36,336 INFO L273 TraceCheckUtils]: 143: Hoare triple {31710#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:36,337 INFO L273 TraceCheckUtils]: 144: Hoare triple {31710#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31710#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:36,337 INFO L273 TraceCheckUtils]: 145: Hoare triple {31710#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:36,338 INFO L273 TraceCheckUtils]: 146: Hoare triple {31711#(<= main_~i~0 35)} assume true; {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:36,338 INFO L273 TraceCheckUtils]: 147: Hoare triple {31711#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:36,339 INFO L273 TraceCheckUtils]: 148: Hoare triple {31711#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31711#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:36,340 INFO L273 TraceCheckUtils]: 149: Hoare triple {31711#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:36,340 INFO L273 TraceCheckUtils]: 150: Hoare triple {31712#(<= main_~i~0 36)} assume true; {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:36,341 INFO L273 TraceCheckUtils]: 151: Hoare triple {31712#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:36,341 INFO L273 TraceCheckUtils]: 152: Hoare triple {31712#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31712#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:36,342 INFO L273 TraceCheckUtils]: 153: Hoare triple {31712#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:36,342 INFO L273 TraceCheckUtils]: 154: Hoare triple {31713#(<= main_~i~0 37)} assume true; {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:36,343 INFO L273 TraceCheckUtils]: 155: Hoare triple {31713#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:36,343 INFO L273 TraceCheckUtils]: 156: Hoare triple {31713#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31713#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:36,344 INFO L273 TraceCheckUtils]: 157: Hoare triple {31713#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:36,345 INFO L273 TraceCheckUtils]: 158: Hoare triple {31714#(<= main_~i~0 38)} assume true; {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:36,345 INFO L273 TraceCheckUtils]: 159: Hoare triple {31714#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:36,346 INFO L273 TraceCheckUtils]: 160: Hoare triple {31714#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {31714#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:36,346 INFO L273 TraceCheckUtils]: 161: Hoare triple {31714#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31715#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:36,347 INFO L273 TraceCheckUtils]: 162: Hoare triple {31715#(<= main_~i~0 39)} assume true; {31715#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:36,347 INFO L273 TraceCheckUtils]: 163: Hoare triple {31715#(<= main_~i~0 39)} assume !(~i~0 < 100000); {31675#false} is VALID [2018-11-18 22:59:36,348 INFO L273 TraceCheckUtils]: 164: Hoare triple {31675#false} havoc ~x~0;~x~0 := 0; {31675#false} is VALID [2018-11-18 22:59:36,348 INFO L273 TraceCheckUtils]: 165: Hoare triple {31675#false} assume true; {31675#false} is VALID [2018-11-18 22:59:36,348 INFO L273 TraceCheckUtils]: 166: Hoare triple {31675#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {31675#false} is VALID [2018-11-18 22:59:36,348 INFO L256 TraceCheckUtils]: 167: Hoare triple {31675#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {31675#false} is VALID [2018-11-18 22:59:36,348 INFO L273 TraceCheckUtils]: 168: Hoare triple {31675#false} ~cond := #in~cond; {31675#false} is VALID [2018-11-18 22:59:36,349 INFO L273 TraceCheckUtils]: 169: Hoare triple {31675#false} assume 0 == ~cond; {31675#false} is VALID [2018-11-18 22:59:36,349 INFO L273 TraceCheckUtils]: 170: Hoare triple {31675#false} assume !false; {31675#false} is VALID [2018-11-18 22:59:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:36,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:59:36,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-18 22:59:36,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-18 22:59:36,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:59:36,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-18 22:59:36,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:36,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 22:59:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 22:59:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:59:36,580 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand 43 states. [2018-11-18 22:59:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:37,652 INFO L93 Difference]: Finished difference Result 206 states and 253 transitions. [2018-11-18 22:59:37,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 22:59:37,652 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 171 [2018-11-18 22:59:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:59:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:59:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 253 transitions. [2018-11-18 22:59:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 22:59:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 253 transitions. [2018-11-18 22:59:37,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 253 transitions. [2018-11-18 22:59:37,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:59:37,892 INFO L225 Difference]: With dead ends: 206 [2018-11-18 22:59:37,892 INFO L226 Difference]: Without dead ends: 188 [2018-11-18 22:59:37,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 22:59:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-18 22:59:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-18 22:59:37,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:59:37,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-18 22:59:37,937 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-18 22:59:37,938 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-18 22:59:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:37,941 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2018-11-18 22:59:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2018-11-18 22:59:37,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:37,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:37,941 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-18 22:59:37,942 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-18 22:59:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:59:37,945 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2018-11-18 22:59:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2018-11-18 22:59:37,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:59:37,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:59:37,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:59:37,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:59:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-18 22:59:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2018-11-18 22:59:37,949 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 171 [2018-11-18 22:59:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:59:37,950 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2018-11-18 22:59:37,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 22:59:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2018-11-18 22:59:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-18 22:59:37,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:59:37,951 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:59:37,951 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:59:37,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:59:37,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1013405974, now seen corresponding path program 40 times [2018-11-18 22:59:37,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:59:37,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:59:37,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:37,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:59:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:59:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:59:38,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {33102#true} call ULTIMATE.init(); {33102#true} is VALID [2018-11-18 22:59:38,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {33102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33102#true} is VALID [2018-11-18 22:59:38,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {33102#true} assume true; {33102#true} is VALID [2018-11-18 22:59:38,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33102#true} {33102#true} #73#return; {33102#true} is VALID [2018-11-18 22:59:38,871 INFO L256 TraceCheckUtils]: 4: Hoare triple {33102#true} call #t~ret7 := main(); {33102#true} is VALID [2018-11-18 22:59:38,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {33102#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {33104#(= main_~i~0 0)} is VALID [2018-11-18 22:59:38,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {33104#(= main_~i~0 0)} assume true; {33104#(= main_~i~0 0)} is VALID [2018-11-18 22:59:38,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {33104#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33104#(= main_~i~0 0)} is VALID [2018-11-18 22:59:38,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {33104#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33104#(= main_~i~0 0)} is VALID [2018-11-18 22:59:38,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {33104#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33105#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:38,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {33105#(<= main_~i~0 1)} assume true; {33105#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:38,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {33105#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33105#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:38,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {33105#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33105#(<= main_~i~0 1)} is VALID [2018-11-18 22:59:38,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {33105#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33106#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:38,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {33106#(<= main_~i~0 2)} assume true; {33106#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:38,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {33106#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33106#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:38,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {33106#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33106#(<= main_~i~0 2)} is VALID [2018-11-18 22:59:38,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {33106#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33107#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:38,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {33107#(<= main_~i~0 3)} assume true; {33107#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:38,879 INFO L273 TraceCheckUtils]: 19: Hoare triple {33107#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33107#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:38,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {33107#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33107#(<= main_~i~0 3)} is VALID [2018-11-18 22:59:38,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {33107#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33108#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:38,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {33108#(<= main_~i~0 4)} assume true; {33108#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:38,881 INFO L273 TraceCheckUtils]: 23: Hoare triple {33108#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33108#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:38,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {33108#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33108#(<= main_~i~0 4)} is VALID [2018-11-18 22:59:38,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {33108#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33109#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:38,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {33109#(<= main_~i~0 5)} assume true; {33109#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:38,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {33109#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33109#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:38,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {33109#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33109#(<= main_~i~0 5)} is VALID [2018-11-18 22:59:38,885 INFO L273 TraceCheckUtils]: 29: Hoare triple {33109#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33110#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:38,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {33110#(<= main_~i~0 6)} assume true; {33110#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:38,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {33110#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33110#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:38,886 INFO L273 TraceCheckUtils]: 32: Hoare triple {33110#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33110#(<= main_~i~0 6)} is VALID [2018-11-18 22:59:38,887 INFO L273 TraceCheckUtils]: 33: Hoare triple {33110#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33111#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:38,887 INFO L273 TraceCheckUtils]: 34: Hoare triple {33111#(<= main_~i~0 7)} assume true; {33111#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:38,888 INFO L273 TraceCheckUtils]: 35: Hoare triple {33111#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33111#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:38,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {33111#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33111#(<= main_~i~0 7)} is VALID [2018-11-18 22:59:38,889 INFO L273 TraceCheckUtils]: 37: Hoare triple {33111#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33112#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:38,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {33112#(<= main_~i~0 8)} assume true; {33112#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:38,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {33112#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33112#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:38,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {33112#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33112#(<= main_~i~0 8)} is VALID [2018-11-18 22:59:38,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {33112#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33113#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:38,892 INFO L273 TraceCheckUtils]: 42: Hoare triple {33113#(<= main_~i~0 9)} assume true; {33113#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:38,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {33113#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33113#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:38,893 INFO L273 TraceCheckUtils]: 44: Hoare triple {33113#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33113#(<= main_~i~0 9)} is VALID [2018-11-18 22:59:38,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {33113#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33114#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:38,894 INFO L273 TraceCheckUtils]: 46: Hoare triple {33114#(<= main_~i~0 10)} assume true; {33114#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:38,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {33114#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33114#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:38,895 INFO L273 TraceCheckUtils]: 48: Hoare triple {33114#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33114#(<= main_~i~0 10)} is VALID [2018-11-18 22:59:38,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {33114#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33115#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:38,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {33115#(<= main_~i~0 11)} assume true; {33115#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:38,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {33115#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33115#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:38,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {33115#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33115#(<= main_~i~0 11)} is VALID [2018-11-18 22:59:38,898 INFO L273 TraceCheckUtils]: 53: Hoare triple {33115#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33116#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:38,898 INFO L273 TraceCheckUtils]: 54: Hoare triple {33116#(<= main_~i~0 12)} assume true; {33116#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:38,899 INFO L273 TraceCheckUtils]: 55: Hoare triple {33116#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33116#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:38,899 INFO L273 TraceCheckUtils]: 56: Hoare triple {33116#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33116#(<= main_~i~0 12)} is VALID [2018-11-18 22:59:38,900 INFO L273 TraceCheckUtils]: 57: Hoare triple {33116#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33117#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:38,900 INFO L273 TraceCheckUtils]: 58: Hoare triple {33117#(<= main_~i~0 13)} assume true; {33117#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:38,901 INFO L273 TraceCheckUtils]: 59: Hoare triple {33117#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33117#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:38,901 INFO L273 TraceCheckUtils]: 60: Hoare triple {33117#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33117#(<= main_~i~0 13)} is VALID [2018-11-18 22:59:38,902 INFO L273 TraceCheckUtils]: 61: Hoare triple {33117#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33118#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:38,903 INFO L273 TraceCheckUtils]: 62: Hoare triple {33118#(<= main_~i~0 14)} assume true; {33118#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:38,903 INFO L273 TraceCheckUtils]: 63: Hoare triple {33118#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33118#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:38,904 INFO L273 TraceCheckUtils]: 64: Hoare triple {33118#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33118#(<= main_~i~0 14)} is VALID [2018-11-18 22:59:38,904 INFO L273 TraceCheckUtils]: 65: Hoare triple {33118#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33119#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:38,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {33119#(<= main_~i~0 15)} assume true; {33119#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:38,905 INFO L273 TraceCheckUtils]: 67: Hoare triple {33119#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33119#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:38,906 INFO L273 TraceCheckUtils]: 68: Hoare triple {33119#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33119#(<= main_~i~0 15)} is VALID [2018-11-18 22:59:38,907 INFO L273 TraceCheckUtils]: 69: Hoare triple {33119#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33120#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:38,907 INFO L273 TraceCheckUtils]: 70: Hoare triple {33120#(<= main_~i~0 16)} assume true; {33120#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:38,908 INFO L273 TraceCheckUtils]: 71: Hoare triple {33120#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33120#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:38,908 INFO L273 TraceCheckUtils]: 72: Hoare triple {33120#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33120#(<= main_~i~0 16)} is VALID [2018-11-18 22:59:38,909 INFO L273 TraceCheckUtils]: 73: Hoare triple {33120#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33121#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:38,909 INFO L273 TraceCheckUtils]: 74: Hoare triple {33121#(<= main_~i~0 17)} assume true; {33121#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:38,910 INFO L273 TraceCheckUtils]: 75: Hoare triple {33121#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33121#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:38,910 INFO L273 TraceCheckUtils]: 76: Hoare triple {33121#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33121#(<= main_~i~0 17)} is VALID [2018-11-18 22:59:38,911 INFO L273 TraceCheckUtils]: 77: Hoare triple {33121#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33122#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:38,911 INFO L273 TraceCheckUtils]: 78: Hoare triple {33122#(<= main_~i~0 18)} assume true; {33122#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:38,912 INFO L273 TraceCheckUtils]: 79: Hoare triple {33122#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33122#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:38,912 INFO L273 TraceCheckUtils]: 80: Hoare triple {33122#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33122#(<= main_~i~0 18)} is VALID [2018-11-18 22:59:38,913 INFO L273 TraceCheckUtils]: 81: Hoare triple {33122#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33123#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:38,914 INFO L273 TraceCheckUtils]: 82: Hoare triple {33123#(<= main_~i~0 19)} assume true; {33123#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:38,914 INFO L273 TraceCheckUtils]: 83: Hoare triple {33123#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33123#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:38,915 INFO L273 TraceCheckUtils]: 84: Hoare triple {33123#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33123#(<= main_~i~0 19)} is VALID [2018-11-18 22:59:38,915 INFO L273 TraceCheckUtils]: 85: Hoare triple {33123#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33124#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:38,916 INFO L273 TraceCheckUtils]: 86: Hoare triple {33124#(<= main_~i~0 20)} assume true; {33124#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:38,916 INFO L273 TraceCheckUtils]: 87: Hoare triple {33124#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33124#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:38,917 INFO L273 TraceCheckUtils]: 88: Hoare triple {33124#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33124#(<= main_~i~0 20)} is VALID [2018-11-18 22:59:38,918 INFO L273 TraceCheckUtils]: 89: Hoare triple {33124#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33125#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:38,918 INFO L273 TraceCheckUtils]: 90: Hoare triple {33125#(<= main_~i~0 21)} assume true; {33125#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:38,918 INFO L273 TraceCheckUtils]: 91: Hoare triple {33125#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33125#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:38,919 INFO L273 TraceCheckUtils]: 92: Hoare triple {33125#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33125#(<= main_~i~0 21)} is VALID [2018-11-18 22:59:38,920 INFO L273 TraceCheckUtils]: 93: Hoare triple {33125#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33126#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:38,920 INFO L273 TraceCheckUtils]: 94: Hoare triple {33126#(<= main_~i~0 22)} assume true; {33126#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:38,921 INFO L273 TraceCheckUtils]: 95: Hoare triple {33126#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33126#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:38,921 INFO L273 TraceCheckUtils]: 96: Hoare triple {33126#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33126#(<= main_~i~0 22)} is VALID [2018-11-18 22:59:38,922 INFO L273 TraceCheckUtils]: 97: Hoare triple {33126#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33127#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:38,922 INFO L273 TraceCheckUtils]: 98: Hoare triple {33127#(<= main_~i~0 23)} assume true; {33127#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:38,923 INFO L273 TraceCheckUtils]: 99: Hoare triple {33127#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33127#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:38,923 INFO L273 TraceCheckUtils]: 100: Hoare triple {33127#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33127#(<= main_~i~0 23)} is VALID [2018-11-18 22:59:38,924 INFO L273 TraceCheckUtils]: 101: Hoare triple {33127#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33128#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:38,925 INFO L273 TraceCheckUtils]: 102: Hoare triple {33128#(<= main_~i~0 24)} assume true; {33128#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:38,925 INFO L273 TraceCheckUtils]: 103: Hoare triple {33128#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33128#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:38,926 INFO L273 TraceCheckUtils]: 104: Hoare triple {33128#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33128#(<= main_~i~0 24)} is VALID [2018-11-18 22:59:38,926 INFO L273 TraceCheckUtils]: 105: Hoare triple {33128#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33129#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:38,927 INFO L273 TraceCheckUtils]: 106: Hoare triple {33129#(<= main_~i~0 25)} assume true; {33129#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:38,927 INFO L273 TraceCheckUtils]: 107: Hoare triple {33129#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33129#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:38,928 INFO L273 TraceCheckUtils]: 108: Hoare triple {33129#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33129#(<= main_~i~0 25)} is VALID [2018-11-18 22:59:38,928 INFO L273 TraceCheckUtils]: 109: Hoare triple {33129#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33130#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:38,929 INFO L273 TraceCheckUtils]: 110: Hoare triple {33130#(<= main_~i~0 26)} assume true; {33130#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:38,929 INFO L273 TraceCheckUtils]: 111: Hoare triple {33130#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33130#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:38,930 INFO L273 TraceCheckUtils]: 112: Hoare triple {33130#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33130#(<= main_~i~0 26)} is VALID [2018-11-18 22:59:38,931 INFO L273 TraceCheckUtils]: 113: Hoare triple {33130#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33131#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:38,931 INFO L273 TraceCheckUtils]: 114: Hoare triple {33131#(<= main_~i~0 27)} assume true; {33131#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:38,932 INFO L273 TraceCheckUtils]: 115: Hoare triple {33131#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33131#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:38,932 INFO L273 TraceCheckUtils]: 116: Hoare triple {33131#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33131#(<= main_~i~0 27)} is VALID [2018-11-18 22:59:38,933 INFO L273 TraceCheckUtils]: 117: Hoare triple {33131#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33132#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:38,933 INFO L273 TraceCheckUtils]: 118: Hoare triple {33132#(<= main_~i~0 28)} assume true; {33132#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:38,934 INFO L273 TraceCheckUtils]: 119: Hoare triple {33132#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33132#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:38,934 INFO L273 TraceCheckUtils]: 120: Hoare triple {33132#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33132#(<= main_~i~0 28)} is VALID [2018-11-18 22:59:38,935 INFO L273 TraceCheckUtils]: 121: Hoare triple {33132#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33133#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:38,936 INFO L273 TraceCheckUtils]: 122: Hoare triple {33133#(<= main_~i~0 29)} assume true; {33133#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:38,936 INFO L273 TraceCheckUtils]: 123: Hoare triple {33133#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33133#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:38,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {33133#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33133#(<= main_~i~0 29)} is VALID [2018-11-18 22:59:38,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {33133#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33134#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:38,938 INFO L273 TraceCheckUtils]: 126: Hoare triple {33134#(<= main_~i~0 30)} assume true; {33134#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:38,938 INFO L273 TraceCheckUtils]: 127: Hoare triple {33134#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33134#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:38,939 INFO L273 TraceCheckUtils]: 128: Hoare triple {33134#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33134#(<= main_~i~0 30)} is VALID [2018-11-18 22:59:38,939 INFO L273 TraceCheckUtils]: 129: Hoare triple {33134#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33135#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:38,940 INFO L273 TraceCheckUtils]: 130: Hoare triple {33135#(<= main_~i~0 31)} assume true; {33135#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:38,940 INFO L273 TraceCheckUtils]: 131: Hoare triple {33135#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33135#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:38,941 INFO L273 TraceCheckUtils]: 132: Hoare triple {33135#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33135#(<= main_~i~0 31)} is VALID [2018-11-18 22:59:38,942 INFO L273 TraceCheckUtils]: 133: Hoare triple {33135#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33136#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:38,942 INFO L273 TraceCheckUtils]: 134: Hoare triple {33136#(<= main_~i~0 32)} assume true; {33136#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:38,943 INFO L273 TraceCheckUtils]: 135: Hoare triple {33136#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33136#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:38,943 INFO L273 TraceCheckUtils]: 136: Hoare triple {33136#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33136#(<= main_~i~0 32)} is VALID [2018-11-18 22:59:38,944 INFO L273 TraceCheckUtils]: 137: Hoare triple {33136#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33137#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:38,944 INFO L273 TraceCheckUtils]: 138: Hoare triple {33137#(<= main_~i~0 33)} assume true; {33137#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:38,945 INFO L273 TraceCheckUtils]: 139: Hoare triple {33137#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33137#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:38,945 INFO L273 TraceCheckUtils]: 140: Hoare triple {33137#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33137#(<= main_~i~0 33)} is VALID [2018-11-18 22:59:38,946 INFO L273 TraceCheckUtils]: 141: Hoare triple {33137#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33138#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:38,947 INFO L273 TraceCheckUtils]: 142: Hoare triple {33138#(<= main_~i~0 34)} assume true; {33138#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:38,947 INFO L273 TraceCheckUtils]: 143: Hoare triple {33138#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33138#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:38,947 INFO L273 TraceCheckUtils]: 144: Hoare triple {33138#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33138#(<= main_~i~0 34)} is VALID [2018-11-18 22:59:38,948 INFO L273 TraceCheckUtils]: 145: Hoare triple {33138#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33139#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:38,949 INFO L273 TraceCheckUtils]: 146: Hoare triple {33139#(<= main_~i~0 35)} assume true; {33139#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:38,949 INFO L273 TraceCheckUtils]: 147: Hoare triple {33139#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33139#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:38,950 INFO L273 TraceCheckUtils]: 148: Hoare triple {33139#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33139#(<= main_~i~0 35)} is VALID [2018-11-18 22:59:38,950 INFO L273 TraceCheckUtils]: 149: Hoare triple {33139#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33140#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:38,951 INFO L273 TraceCheckUtils]: 150: Hoare triple {33140#(<= main_~i~0 36)} assume true; {33140#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:38,951 INFO L273 TraceCheckUtils]: 151: Hoare triple {33140#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33140#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:38,952 INFO L273 TraceCheckUtils]: 152: Hoare triple {33140#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33140#(<= main_~i~0 36)} is VALID [2018-11-18 22:59:38,953 INFO L273 TraceCheckUtils]: 153: Hoare triple {33140#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33141#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:38,953 INFO L273 TraceCheckUtils]: 154: Hoare triple {33141#(<= main_~i~0 37)} assume true; {33141#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:38,954 INFO L273 TraceCheckUtils]: 155: Hoare triple {33141#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33141#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:38,954 INFO L273 TraceCheckUtils]: 156: Hoare triple {33141#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33141#(<= main_~i~0 37)} is VALID [2018-11-18 22:59:38,955 INFO L273 TraceCheckUtils]: 157: Hoare triple {33141#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33142#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:38,955 INFO L273 TraceCheckUtils]: 158: Hoare triple {33142#(<= main_~i~0 38)} assume true; {33142#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:38,956 INFO L273 TraceCheckUtils]: 159: Hoare triple {33142#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33142#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:38,956 INFO L273 TraceCheckUtils]: 160: Hoare triple {33142#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33142#(<= main_~i~0 38)} is VALID [2018-11-18 22:59:38,957 INFO L273 TraceCheckUtils]: 161: Hoare triple {33142#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33143#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:38,958 INFO L273 TraceCheckUtils]: 162: Hoare triple {33143#(<= main_~i~0 39)} assume true; {33143#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:38,958 INFO L273 TraceCheckUtils]: 163: Hoare triple {33143#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {33143#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:38,958 INFO L273 TraceCheckUtils]: 164: Hoare triple {33143#(<= main_~i~0 39)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {33143#(<= main_~i~0 39)} is VALID [2018-11-18 22:59:38,959 INFO L273 TraceCheckUtils]: 165: Hoare triple {33143#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {33144#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:38,960 INFO L273 TraceCheckUtils]: 166: Hoare triple {33144#(<= main_~i~0 40)} assume true; {33144#(<= main_~i~0 40)} is VALID [2018-11-18 22:59:38,960 INFO L273 TraceCheckUtils]: 167: Hoare triple {33144#(<= main_~i~0 40)} assume !(~i~0 < 100000); {33103#false} is VALID [2018-11-18 22:59:38,961 INFO L273 TraceCheckUtils]: 168: Hoare triple {33103#false} havoc ~x~0;~x~0 := 0; {33103#false} is VALID [2018-11-18 22:59:38,961 INFO L273 TraceCheckUtils]: 169: Hoare triple {33103#false} assume true; {33103#false} is VALID [2018-11-18 22:59:38,961 INFO L273 TraceCheckUtils]: 170: Hoare triple {33103#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {33103#false} is VALID [2018-11-18 22:59:38,961 INFO L256 TraceCheckUtils]: 171: Hoare triple {33103#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {33103#false} is VALID [2018-11-18 22:59:38,961 INFO L273 TraceCheckUtils]: 172: Hoare triple {33103#false} ~cond := #in~cond; {33103#false} is VALID [2018-11-18 22:59:38,961 INFO L273 TraceCheckUtils]: 173: Hoare triple {33103#false} assume 0 == ~cond; {33103#false} is VALID [2018-11-18 22:59:38,962 INFO L273 TraceCheckUtils]: 174: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2018-11-18 22:59:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:59:38,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:59:38,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:59:38,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST